default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 17
Volume 17, Number 1, 1997
- Pankaj K. Agarwal, Boris Aronov
, János Pach, Richard Pollack, Micha Sharir:
Quasi-Planar Graphs Have a Linear Number of Edges. 1-9 - Rudolf Ahlswede, Ning Cai:
Shadows and Isoperimetry Under the Sequence-Subsequence Relation. 11-29 - Simeon Ball, Aart Blokhuis, Francesco Mazzocca:
Maximal Arcs in Desarguesian Planes of Odd Order do not Exist. 31-41 - Dror Bar-Natan:
Lie Algebras and the Four Color Theorem. 43-52 - Anders Björner, Sinisa T. Vrecica:
On f-Vectors and Betti Numbers of Multicomplexes. 53-65 - Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Universally Signable Graphs. 67-77 - Uriel Feige:
Randomized Graph Products, Chromatic Numbers, and the Lovász vartheta-Funktion. 79-90 - Howard J. Karloff, Yishay Mansour:
On Construction of k-Wise Independent Random Variables. 91-107 - János Komlós, Gábor N. Sárközy, Endre Szemerédi:
Blow-Up Lemma. 109-123 - Andrew Thomason:
Graph Products and Monochromatic Multiplicities. 125-134 - Huishan Zhou, Xuding Zhu:
Multiplicativity of Acyclic Local Tournaments. 135-145
- Debe Bednarchak, Martin Helm:
A Note on the Beck-Fiala Theorem. 147-149
Volume 17, Number 2, 1997
- Jörg Eisfeld, Klaus Metsch:
Blocking s-Dimensional Subspaces by Lines in PG(2s, q). 151-162 - Zoltán Füredi, Péter Komjáth:
Nonexistence of Universal Graphs Without Some Trees. 163-171 - Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl:
On K4-Free Subgraphs of Random Graphs. 173-213 - Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman:
Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension. 215-234 - Bojan Mohar:
Projective Plane and Möbius Band Obstructions. 235-266 - James G. Oxley:
A Matroid Generalization of a Result of Dirac. 267-273 - Michel Talagrand:
On Boundaries and Influences. 275-285 - Gilles Zémor:
An Upper Bound on the Size of the Snake-In-The-Box. 287-298
- Rudolf Ahlswede, Levon H. Khachatrian:
Counterexample to the Frankl-Pach Conjecture for Uniform, Dense Families. 299-301
Volume 17, Number 3, 1997
- Noga Alon, Michael Krivelevich:
The Concentration of the Chromatic Number of Random Graphs. 303-313 - William H. Cunningham, James F. Geelen:
The Optimal Path-Matching Problem. 315-337 - Tamás Fleiner:
Covering a Symmetric Poset by Symmetric Chains. 339-344 - Joachim von zur Gathen, James R. Roche:
Polynomials with two Values. 345-362 - András Hajnal, Péter Komjáth:
A Strongly Non-Ramsey Order Type. 363-367 - Jeff Kahn, P. Mark Kayll:
On the Stochastic Independence Properties of Hard-Core Distributions. 369-391 - János Komlós:
Covering Odd Cycles. 393-400 - Michael Krivelevich:
On the Minimal Number of Edges in Color-Critical Graphs. 401-426 - János Pach, Géza Tóth:
Graphs Drawn with Few Crossings per Edge. 427-439 - Daniel P. Sanders, Yue Zhao:
On Simultaneous Edge-Face Colorings of Plane Graphs. Comb. 17(3): 441-445 (1997)
Volume 17, Number 4, 1997
- György Elekes:
On Linear Combinatorics I. Concurrency - An Algebraic Approach. 447-458 - Paul Erdös, András Gyárfás:
A Variant of the Classical Ramsey Problem. 459-467 - Hugh Hind, Michael Molloy, Bruce A. Reed:
Colouring a Graph Frugally. 469-482 - Andrew Kotlov, László Lovász, Santosh S. Vempala:
The Colin de Verdière Number and Sphere Representations of a Graph. 483-521 - Thomas Müller:
Finite Group Actions and Asymptotic Expansion of eP(z). 523-554 - Yehuda Shalom:
Expanding Graphs and Invariant Means. 555-575 - Miklós Simonovits, Vera T. Sós:
Hereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced Subgraphs. 577-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 2024-11-21 20:32 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:
