Combinatorica, Volume 23
Volume 23, Number 1, January 2003
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian: Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace. 5-22- Béla Csaba, Ali Shokoufandeh, Endre Szemerédi: Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three. 35-72
- Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz: For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite? 105-150
- Pavel Valtr: Davenport-Schinzel Trees. 151-184
Volume 23, Number 2, April 2003
- Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra: Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. 205-243
- Friedrich Eisenbrand, Andreas S. Schulz: Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. 245-261
- Kevin Ford: Maximal Collections of Intersecting Arithmetic Progressions. 263-281
- Grigor Gasparyan, Myriam Preissmann, András Sebö: Imperfect and Nonideal Clutters: A Common Approach. 283-302
- André E. Kézdy, Jenö Lehel, Robert C. Powers: Heavy Transversals and Indecomposable Hypergraphs. 303-310
Volume 23, Number 3, July 2003
- Richard Ehrenborg, Harold Fox: Inequalities for cd-Indices of Joins and Products of Polytopes. 427-452
- Zhicheng Gao, Nicholas C. Wormald: Sharp Concentration of the Number of Submaps in Random Planar Triangulations. 467-486
- Yair Glasner: Ramanujan Graphs with Small Girth. 487-502
- Satoru Iwata, S. Thomas McCormick, Maiko Shigeno: Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*. 503-525
- Hunter S. Snevily: A Sharp Bound for the Number of Sets that Pairwise Intersect at k Positive Values. 527-533
Volume 23, Number 4, December 2003
- Etsuko Bannai, Kazuki Kawasaki, Yusuke Nitamizu, Teppei Sato: An Upper Bound for the Cardinality of an s-Distance Set in Euclidean Space. 535-557
- András Gács: On a Generalization of Rédei's Theorem. 585-598
- Weidong Gao, Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra: Covering a Finite Abelian Group by Subset Sums. 599-611
- Martin Grohe: Local Tree-Width, Excluded Minors, and Approximation Algorithms. 613-632
- Hein Holst: Two Tree-Width-Like Graph Invariants. 633-651
- Hanno Lefmann: On Heilbronn's Problem in Higher Dimension. 669-680
- Zhi-Wei Sun: On the Function w(x)=|{1= s= k : x= as (mod ns)}|. 681-691
- Stephan Brandt: Note. 693-696
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team