default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 20
Volume 20, Number 1, 2000
- Béla Bajnok, Shahriar Shahriari
:
On Uniform f-vectors of Cutsets in the Truncated Boolean Lattice. 1-14 - Michele Conforti, Bert Gerards, Ajai Kapoor:
A Theorem of Truemper. 15-26 - Péter L. Erdös, Ákos Seress, László A. Székely:
Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets. 27-45 - Ilijas Farah:
Approximate Homomorphisms II: Group Homomorphisms. 47-60 - James F. Geelen:
An Algebraic Matching Algorithm. 61-70 - Vince Grolmusz:
Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs. 71-86 - Jeannette C. M. Janssen, Kyriakos Kilakos:
Adaptive Multicolouring. 87-102 - Jirí Matousek:
On the Signed Domination in Graphs. 103-108 - Erich Prisner:
Bicliques in Graphs I: Bounds on Their Number. 109-117 - Raphael Yuster:
Decomposing Hypergraphs into Simple Hypertrees. 119-140
- Tao Jiang, Dhruv Mubayi:
New Upper Bounds for a Canonical Ramsey Problem. 141-146 - Andrei Kotlov:
Spectral Characterization of Tree-Width-Two Graphs. 147-152
Volume 20, Number 2, 2000
- Sergey G. Bobkov, Christian Houdré, Prasad Tetali:
lambdainfty Vertex Isoperimetry and Concentration. 153-172 - Béla Bollobás, Andrew Thomason:
The Structure of Hereditary Properties and Colourings of Random Graphs. 173-202 - János Komlós:
Tiling Turán Theorems. 203-218 - Mekkia Kouider:
Neighborhoods and Covering Vertices by Cycles. 219-226 - János Körner, Gábor Simonyi:
Graph Pairs and their Entropies: Modularity Problems. 227-240 - Ran Raz:
VC-Dimension of Sets of Permutations. 241-255 - Vojtech Rödl, Endre Szemerédi:
On Size Ramsey Numbers of Graphs with Bounded Degree. 257-262 - Joel Spencer, Gábor Tardos:
Ups and Downs of First Order Sentences on Random Graphs. 263-280 - István Talata:
A Lower Bound for the Translative Kissing Numbers of Simplices. 281-293
- Andrew Dabrowski, Lawrence S. Moss:
The Johnson Graphs Satisfy a Distance Extension Property. 295-300
Volume 20, Number 3, 2000
- Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky:
Testing Monotonicity. 301-337 - Jeff Kahn:
A Normal Law for Matchings. 339-391 - Sanjeev Khanna, Nathan Linial, Shmuel Safra:
On the Hardness of Approximating the Chromatic Number. 393-415 - Jeong Han Kim, Van H. Vu:
Concentration of Multivariate Polynomials and Its Applications. 417-434
- Kathie Cameron:
A Min-Max Relation for Monotone Path Systems in Simple Regions. 435-440 - Dennis Eichhorn, Dhruv Mubayi:
Edge-Coloring Cliques with Many Colors on Subcliques. 441-444 - Romeo Rizzi:
NOTE - On Minimizing Symmetric Set Functions. 445-450
Volume 20, Number 4, 2000
- Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy:
Efficient Testing of Large Graphs. 451-476 - Malgorzata Bednarska, Tomasz Luczak:
Biased Positional Games for Which Random Strategies are Nearly Optimal. 477-488 - Robin Forman:
Morse Theory and Evasiveness. 489-504 - Joel Friedman:
On Cayley Graphs on the Symmetric Group Generated by Tranpositions. 505-519 - Alexandr V. Kostochka, Michael Stiebitz:
On the Number of Edges in Colour-Critical Graphs and Hypergraphs. 521-530 - Benoît Larose, Claude Tardif:
Hedetniemi's Conjecture and the Retracts of a Product of Graphs. 531-544 - Nathan Linial, Alex Samorodnitsky, Avi Wigderson:
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. 545-568 - Lajos Rónyai:
On a Conjecture of Kemnitz. 569-573 - Alexander Schrijver:
Total Dual Integrality of Matching Forest Constraints. 575-588 - Géza Tóth:
Finding Convex Sets in Convex Position. 589-596
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-12-15 22:37 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:
