default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 24
Volume 24, Number 1, January 2004
- Tetsuya Abe:
Sumsets Containing Powers of an Integer. 1-4 - Béla Bollobás, Oliver Riordan:
The Diameter of a Scale-Free Random Graph. 5-34 - Anthony Bonato, Dejan Delic:
On a Problem of Cameron's on Inexhaustible Graphs. 35-51 - Jean-Marc Deshouillers, François Hennecart, Alain Plagne:
On Small Sumsets in (Z/2Z)n. 53-68 - Reinhard Diestel, Daniela Kühn:
On Infinite Cycles I. 69-89 - Reinhard Diestel, Daniela Kühn:
On Infinite Cycles II. 91-116 - Benjamin Doerr:
Linear Discrepancy of Totally Unimodular Matrices. 117-125 - Genghua Fan:
Circular Chromatic Number and Mycielski Graphs. 127-135 - Michelangelo Grigni, Leonard J. Schulman
, Monica Vazirani, Umesh V. Vazirani:
Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem. 137-154 - Daniela Kühn, Deryk Osthus:
Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree. 155-162 - Jirí Matousek:
A Combinatorial Proof of Kneser's Conjecture. 163-170
Volume 24, Number 2, April 2004
- Imre Bárány, Norihide Tokushige:
The Minimum Area of Convex Lattice n-Gons. 171-185 - Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov:
On the Value of a Random Minimum Weight Steiner Tree. 187-207 - Carlos A. Di Prisco, Jimena Llopis, Stevo Todorcevic:
Parametrized Partitions of Products of Finite Sets. 209-232 - Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair:
Cuts, Trees and l1-Embeddings of Graphs. 233-269 - Neil Hindman, Randall McCutcheon:
Partition Theorems for Left and Right Variable Words. 271-286 - Daniela Kühn, Deryk Osthus:
Induced Subdivisions In Ks, s-Free Graphs of Large Average Degree. 287-304 - Uwe Leck:
Nonexistence of a Kruskal-Katona Type Theorem for Subword Orders. 305-312 - Dhruv Mubayi:
An Explicit Construction for a Ramsey Problem. 313-324 - Ján Nincák, Peter J. Owens:
Note. 325-329
Volume 24, Number 3, July 2004
- Jørgen Bang-Jensen, Anders Yeo:
Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. 331-349 - Christian Elsholtz:
Lower Bounds For Multidimensional Zero Sums. 351-358 - Christian Houdré, Prasad Tetali:
Isoperimetric Invariants For Product Markov Chains and Graph Products. 359-388 - Alexandr V. Kostochka, Vojtech Rödl:
On Graphs With Small Ramsey Numbers, II. 389-401 - Michael Krivelevich, Benny Sudakov, Tibor Szabó:
Triangle Factors In Sparse Pseudo-Random Graphs. 403-426 - Bodo Lass:
Matching Polynomials And Duality. 427-440 - Wolfgang Mader:
High Connectivity Keeping Sets In n-Connected Graphs. 441-458 - Klaus Metsch:
Blocking Subspaces By Lines In PG(n, q). 459-486 - Patrice Ossona de Mendez, Pierre Rosenstiehl:
Transitivity And Connectivity Of Permutations. 487-501 - Toniann Pitassi, Ran Raz:
Regular Resolution Lower Bounds For The Weak Pigeonhole Principle. 503-524 - Michael E. Saks, Alex Samorodnitsky, Leonid Zosin:
A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks. 525-530 - Lutz Volkmann:
The Maximum Size Of Graphs With A Unique k- Factor. 531-540
Volume 24, Number 4, September 2004
- Bernardo M. Ábrego, György Elekes, Silvia Fernández-Merchant:
Structural Results For Planar Sets With Many Similar Subsets. 541-554 - Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
On Shadows Of Intersecting Families. 555-566 - Richard Arratia, Béla Bollobás, Gregory B. Sorkin:
A Two-Variable Interlace Polynomial. 567-584 - Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson:
Near Optimal Separation Of Tree-Like And General Resolution. 585-603 - Jaroslaw Grytczuk, Andrzej P. Kisielewicz, Krzysztof Przeslawski:
Minimal Partitions Of A Box Into Boxes. 605-614 - Svante Janson, Andrzej Rucinski:
The Deletion Method For Upper Tail Estimates. 615-640 - Rong Luo, Wenan Zang, Cun-Quan Zhang:
Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares. 641-657 - Roy Meshulam, Avi Wigderson:
Expanders In Group Algebras. 659-680 - Joseph A. Thas, Hendrik Van Maldeghem:
Full Embeddings Of The Finite Dual Split Cayley Hexagons. 681-698 - Carsten Thomassen:
The Locally Connected Compact Metric Spaces Embeddable In The Plane. 699-718 - Jacques Verstraëte:
On The Number Of Sets Of Cycle Lengths. 719-730 - Sanming Zhou:
Almost Covers Of 2-Arc Transitive Graphs. 731-745
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-11-04 00:27 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:
