Combinatorica - researchr journal

researchr

You are not signed in
Sign in
Sign up

449	--	459	Yuri F. Bilu. Sum-Free Sets and Related Sets
461	--	486	André Bouchet, William H. Cunningham, James F. Geelen. Principally Unimodular Skew-Symmetric Matrices
487	--	492	Hikoe Enomoto. On the Existence of Disjoint Cycles in a Graph
493	--	501	Paul Erdös, András Gyárfás, Miklós Ruszinkó. How to decrease the diameter of triangle-free graphs
503	--	518	Greg N. Frederickson, Roberto Solis-Oba. Algorithms for Measuring Perturbability in Matroid Optimization
519	--	527	Weidong Gao, Alfred Geroldinger. On the Structure of Zerofree Sequences
529	--	540	Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra. On Subsets with Small Product in Torsion-Free Groups
541	--	548	Takayuki Hibi. The Comparability Graph of a Modular Lattice
549	--	568	Alexander V. Karzanov. A Combinatorial Algorithm for the Minimum (2, r )-Metric Problem and Some Generalizations
569	--	595	Wolfgang Mader. 3n - 5 Edges Do Force a Subdivision of K::5::

301	--	310	Noga Alon. The Shannon Capacity of a Union
311	--	333	Andrew Beveridge, Alan M. Frieze, Colin McDiarmid. Random Minimum Length Spanning Trees in Regular Graphs
335	--	348	Ilijas Farah. Approximate Homomorphisms
349	--	372	Bernd Gärtner, Martin Henk, Günter M. Ziegler. Randomized Simplex Algorithms on Klee-Minty Cubes
373	--	404	Yoshiharu Kohayakawa, Hans Jürgen Prömel, Vojtech Rödl. Induced Ramsey Numbers
405	--	412	Wolfgang Mader. Topological Subgraphs in Graphs of Large Girth
413	--	424	Mariusz Meszka, Zdzislaw Skupien. Self-Converse and Oriented Graphs among the Third Parts of Nearly Complete Digraphs
425	--	436	Gerald W. Schuster. A Minimum Degree Result for Disjoint Cycles and Forests in Graphs
437	--	439	Yugen Takegahara. On Butler s Unimodality Result
441	--	447	Hong Wang 0022. Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three

151	--	171	Yossi Azar, Rajeev Motwani, Joseph Naor. Approximating Probability Distributions Using Small Sample Spaces
173	--	184	Jason E. Fulman. The Combinatorics of Biased Riffle Shuffles
185	--	189	Francisco Javier González Vieli. A Two-Spheres Problem on Homogeneous Trees
191	--	199	Robert Jajcay. On a Construction of Infinite Families of Regular Cayley Maps
201	--	226	Jeff Kahn, Jeong Han Kim. Random Matchings in Regular Graphs
227	--	234	Jack H. Koolen. The Distance-regular Graphs with Intersection Number a::1::!=0 and with an Eigenvalue -1-(b::1::/2)
235	--	240	Alexandr V. Kostochka, Vojtech Rödl. On Large Systems of Sets with No Large Weak <Delta>-subsystems
241	--	280	Michael Molloy, Bruce A. Reed. A Bound on the Total Chromatic Number
281	--	292	Rudi Pendavingh. On the Relation Between Two Minor-Monotone Graph Parameters
293	--	296	Dhruv Mubayi. Edge-Coloring Cliques with Three Colors on All 4-Cliques
297	--	299	Raimund Seidel. On the Number of Triangulations of Planar Point Sets

1	--	12	Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan. Partitioning Graphs of Bounded Tree-Width
13	--	25	György Elekes. On Linear Combinatorics II. Structure Theorems via Additive Number Theory
27	--	35	Ehud Friedgut. Boolean Functions With Low Average Sensitivity Depend On Few Coordinates
37	--	59	Michel X. Goemans, David P. Williamson. Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs
61	--	83	Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi. A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations
85	--	99	Jeff Kahn, Yang Yu. Log-Concave Functions And Poset Probabilities
101	--	120	Yoshiharu Kohayakawa, Bernd Kreuter, Angelika Steger. An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth
121	--	132	Nathan Linial, Ori Sasson. Non-Expansive Hashing
133	--	137	Pompeo Polito, Olga Polverino. On Small Blocking Sets
139	--	149	Yonutz Stanchescu. On the Simplest Inverse Problem for Sums of Sets in Several Dimensions

runs on WebDSL