Journal: Combinatorica

Volume 23, Issue 4

535 -- 557Etsuko Bannai, Kazuki Kawasaki, Yusuke Nitamizu, Teppei Sato. An Upper Bound for the Cardinality of an s-Distance Set in Euclidean Space
559 -- 570Béla Bollobás, Imre Leader. Set Systems with few Disjoint Pairs
571 -- 584James D. Currie, Cameron W. Pierce. The Fixing Block Method in Combinatorics on Words
585 -- 598András Gács. On a Generalization of Rédei s Theorem
599 -- 611Weidong Gao, Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra. Covering a Finite Abelian Group by Subset Sums
613 -- 632Martin Grohe. Local Tree-Width, Excluded Minors, and Approximation Algorithms
633 -- 651Hein Holst. Two Tree-Width-Like Graph Invariants
653 -- 667Louis Kauffman, Robin Thomas. Temperely-Lieb Algebras and the Four-Color Theorem
669 -- 680Hanno Lefmann. On Heilbronn s Problem in Higher Dimension
681 -- 691Zhi-Wei Sun. On the Function w(x)=|{1= s= k : x= a::s:: (mod n::::::s::::::)}|
693 -- 696Stephan Brandt. Note

Volume 23, Issue 3

365 -- 426Sanjeev Arora, Madhu Sudan. Improved Low-Degree Testing and its Applications
427 -- 452Richard Ehrenborg, Harold Fox. Inequalities for cd-Indices of Joins and Products of Polytopes
453 -- 465Gasper Fijavz, Bojan Mohar. K::6::-Minors in Projective Planar Graphs
467 -- 486Zhicheng Gao, Nicholas C. Wormald. Sharp Concentration of the Number of Submaps in Random Planar Triangulations
487 -- 502Yair Glasner. Ramanujan Graphs with Small Girth
503 -- 525Satoru Iwata, S. Thomas McCormick, Maiko Shigeno. Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*
527 -- 533Hunter S. Snevily. A Sharp Bound for the Number of Sets that Pairwise Intersect at ::::k:::: Positive Values

Volume 23, Issue 2

185 -- 203Guantao Chen, Ronald J. Gould, Xingxing Yu. Graph Connectivity After Path Removal
205 -- 243Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra. Approximating CVP to Within Almost-Polynomial Factors is NP-Hard
245 -- 261Friedrich Eisenbrand, Andreas S. Schulz. Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
263 -- 281Kevin Ford. Maximal Collections of Intersecting Arithmetic Progressions
283 -- 302Grigor Gasparyan, Myriam Preissmann, András Sebö. Imperfect and Nonideal Clutters: A Common Approach
303 -- 310André E. Kézdy, Jenö Lehel, Robert C. Powers. Heavy Transversals and Indecomposable Hypergraphs
311 -- 363Jeong Han Kim, Van H. Vu. Small Complete Arcs in Projective Planes

Volume 23, Issue 1

5 -- 22Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian. Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace
23 -- 34Anders Björner, Mark de Longueville. Neighborhood Complexes of Stable Kneser Graphs
35 -- 72Béla Csaba, Ali Shokoufandeh, Endre Szemerédi. Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three
73 -- 87Robert M. Guralnick, Aner Shalev. On the Spread of Finite Simple Groups
89 -- 104András Hajnal, Péter Komjáth. Some Remarks on the Simultaneous Chromatic Number
105 -- 150Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz. For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?
151 -- 184Pavel Valtr. Davenport-Schinzel Trees