default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, 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 - Anders Björner, Mark de Longueville:
Neighborhood Complexes of Stable Kneser Graphs. 23-34 - 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 - Robert M. Guralnick, Aner Shalev:
On the Spread of Finite Simple Groups. 73-87 - András Hajnal, Péter Komjáth:
Some Remarks on the Simultaneous Chromatic Number. 89-104 - 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
- Guantao Chen, Ronald J. Gould, Xingxing Yu:
Graph Connectivity After Path Removal. 185-203 - 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 - Jeong Han Kim, Van H. Vu:
Small Complete Arcs in Projective Planes. 311-363
Volume 23, Number 3, July 2003
- Sanjeev Arora, Madhu Sudan:
Improved Low-Degree Testing and its Applications. 365-426 - Richard Ehrenborg, Harold Fox:
Inequalities for cd-Indices of Joins and Products of Polytopes. 427-452 - Gasper Fijavz, Bojan Mohar:
K6-Minors in Projective Planar Graphs. 453-465 - 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 - Béla Bollobás, Imre Leader:
Set Systems with few Disjoint Pairs. 559-570 - James D. Currie, Cameron W. Pierce:
The Fixing Block Method in Combinatorics on Words. 571-584 - 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 van der Holst:
Two Tree-Width-Like Graph Invariants. 633-651 - Louis Kauffman, Robin Thomas:
Temperely-Lieb Algebras and the Four-Color Theorem. 653-667 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-24 17:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
