default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 29
Volume 29, Number 1, January 2009
- John Bamberg
, Maska Law, Tim Penttila:
Tight sets and m-ovoids of generalised quadrangles. 1-17 - Massimo Giulietti:
Line partitions of internal points to a conic in PG(2, q). 19-25 - Marek Janata, Jácint Szabó:
The superstar packing problem. 27-48 - Hal A. Kierstead, Goran Konjevod:
Coloring number and on-line Ramsey theory for graphs and hypergraphs. 49-64 - Daniela Kühn, Deryk Osthus:
The minimum degree threshold for perfect graph packings. 65-107 - Serguei Norine:
Drawing 4-Pfaffian graphs on the torus. 109-119 - Werner Schwärzler:
On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary. 121-126 - Masao Tsugaki:
A note on a spanning 3-tree. 127-129
Volume 29, Number 2, March 2009
- Béla Bollobás, Boris G. Pittel:
The distribution of the root degree of a random permutation. 131-151 - Jacob Fox, Benny Sudakov:
Density theorems for bipartite graphs and related Ramsey-type results. 153-196 - Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
Arc-disjoint in-trees in directed graphs. 197-214 - Ken-ichi Kawarabayashi, Bruce A. Reed:
Highly parity linked graphs. 215-225 - Vladimir Nikiforov, Cecil C. Rousseau:
Ramsey goodness and beyond. 227-262
Volume 29, Number 3, May 2009
- Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs. 263-297 - Bill Cuckler, Jeff Kahn:
Hamiltonian cycles in Dirac graphs. 299-326 - Bill Cuckler, Jeff Kahn:
Entropy bounds for perfect matchings and Hamiltonian cycles. 327-335 - Hein van der Holst, Rudi Pendavingh:
On a graph property generalizing planarity and flatness. 337-361 - Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi:
On the Fourier spectrum of symmetric Boolean functions. 363-387
Volume 29, Number 4, July 2009
- Noga Alon, Eyal Lubetzky:
Uniformly cross intersecting families. 389-431 - Anton Dochtermann:
The universality of Hom complexes of graphs. 433-448 - Attila Pór, David R. Wood:
Colourings of the cartesian product of graphs and multiplicative Sidon sets. 449-466 - Vojtech Rödl, Mathias Schacht:
Generalizations of the removal lemma. 467-501 - John P. Steinberger:
Tilings of the integers can have superpolynomial periods. 503-509
Volume 29, Number 5, September 2009
- Simeon Ball, Oriol Serra:
Punctured combinatorial Nullstellensätze. 511-522 - Saugata Basu, Richard Pollack, Marie-Françoise Roy:
An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions. 523-546 - Dan Hefetz, Michael Krivelevich, Tibor Szabó:
Hamilton cycles in highly connected and expanding graphs. 547-568 - Beukje Temmermans, Joseph A. Thas, Hendrik Van Maldeghem:
On collineations and dualities of finite generalized polygons. 569-594 - Baogang Xu, Xingxing Yu:
On a bipartition problem of Bollobás and Scott. 595-618 - Tamás Király, Jácint Szabó:
A note on parity constrained orientations. 619-628
Volume 29, Number 6, November 2009
- Mei-Chu Chang:
Explicit sum-product theorems for large subsets of \mathbbFp. 629-635 - Gary L. Ebert, Giuseppe Marino, Olga Polverino, Rocco Trombetti:
Infinite families of new semifields. 637-663 - Babak Farzad, Michael Molloy:
On the edge-density of 4-critical graphs. 665-689 - Komei Fukuda, Sonoko Moriyama, Hiroki Nakayama, Jürgen Richter-Gebert:
Every non-Euclidean oriented matroid admits a biquadratic final polynomial. 691-698 - Vít Jelínek, Jan Kyncl, Rudolf Stolar, Tomás Valla:
Monochromatic triangles in two-colored plane. 699-718 - Emanuele Viola, Avi Wigderson:
One-way multiparty communication lower bound for pointer jumping with applications. 719-743
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-06 00:12 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:
