Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 28
Volume 28, Number 1, January 2008
- Maria Chudnovsky
, Paul D. Seymour, Blair D. Sullivan:
Cycles in dense digraphs. 1-18
- Erik D. Demaine, MohammadTaghi Hajiaghayi:
Linearity of grid minors in treewidth with applications through bidimensionality. 19-36 - Ori Einstein:
Properties of intersecting families of ordered sets. 37-44 - Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura:
The stable set polytope of quasi-line graphs. 45-67 - Jacob E. Goodman, Richard Pollack:
The combinatorial encoding of disjoint convex sets in the plane. 69-81 - Satoru Iwata, Takuro Matsuda:
Finding coherent cyclic orders in strong digraphs. 83-88 - Serguei Norine:
Pfaffian graphs, T -joins and crossing numbers. 89-98 - Serguei Norine, Robin Thomas:
Pfaffian labelings and signs of edge colorings. 99-111 - József Solymosi, Van H. Vu:
Near optimal bounds for the Erdös distinct distances problem in high dimensions. 113-125 - Rom Pinchasi:
Geometric graphs with no two parallel edges. 127-130
Volume 28, Number 2, March 2008
- Pierre Charbit, András Sebö:
Cyclic orders: Equivalence and duality. 131-143 - Maria Chudnovsky, William H. Cunningham, Jim Geelen:
An algorithm for packing non-zero A -paths in group-labelled graphs. 145-161 - Assaf Naor, Jacques Verstraëte:
Parity check matrices and product representations of squares. 163-185 - Oleg Pikhurko:
An exact Turán result for the generalized triangle. 187-208 - Siddhartha Sahi:
Higher correlation inequalities. 209-227 - Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski:
An approximate Dirac-type theorem for k -uniform hypergraphs. 229-260
Volume 28, Number 3, May 2008
- Noga Alon, Asaf Shapira:
A separation theorem in property testing. 261-281 - Jonah Blasiak:
The toric ideal of a graphic matroid is generated by quadrics. 283-297 - Michael I. Hartley:
An exploration of locally projective polytopes. 299-314 - Jürgen Herzog, Satoshi Murai, Xinxian Zheng, Takayuki Hibi, Ngô Viêt Trung:
Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs. 315-323 - Daniel Král, Robin Thomas:
Coloring even-faced graphs in the torus and the Klein bottle. 325-341 - Yonutz Stanchescu:
Three-dimensional sets with small sumset. 343-355 - Benny Sudakov, Jacques Verstraëte:
Cycle lengths in sparse graphs. 357-372 - Peter Dukes, Alan C. H. Ling:
Note edge-colourings of K n, n with no long two-coloured cycles. 373-378
Volume 28, Number 4, July 2008
- Jorge L. Arocha, Javier Bracho, Luis Montejano:
A colorful theorem on transversal lines to plane convex sets. 379-384 - Robert Brignall, Sophie Huczynska, Vincent Vatter:
Decomposing simple permutations, with enumerative consequences. 385-400 - Javier Cilleruelo, Melvyn B. Nathanson:
Perfect difference sets constructed from Sidon sets. 401-414 - Ariel Gabizon, Ran Raz:
Deterministic extractors for affine sources over large fields. 415-440 - Yahya Ould Hamidoune, Oriol Serra, Gilles Zémor:
On the critical pair theory in abelian groups: Beyond Chowla's Theorem. 441-467 - Hemanshu Kaul, Alexandr V. Kostochka, Gexin Yu:
On a graph packing conjecture by Bollobás, Eldridge and Catlin. 469-485 - Dragomir Z. Dokovic:
Hadamard matrices of order 764 exist. 487-489 - Vsevolod F. Lev:
The rectifiability threshold in abelian groups. 491-497 - András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi:
Three-color Ramsey numbers for paths. 499-502
Volume 28, Number 5, September 2008
- Ehud Friedgut:
On the measure of intersecting families, uniqueness and stability. 503-528 - Tobias Müller:
Two-point concentration in random geometric graphs. 529-545 - Terence Tao:
Product set estimates for non-commutative groups. 547-594 - Carsten Thomassen, Antoine Vella:
Graph-like continua, augmenting arcs, and Menger's theorem. 595-623
Volume 28, Number 6, November 2008
- David P. Bunde, Kevin G. Milans, Douglas B. West, Hehui Wu:
Optimal strong parity edge-coloring of complete graphs. 625-632 - Andreas F. Holmsen, János Pach, Helge Tverberg:
Points surrounding the origin. 633-644 - Bill Jackson, Tibor Jordán:
On the rigidity of molecular graphs. 645-658 - Jean A. Larson:
Counting canonical partitions in the random graph. 659-678 - Márton Makai, Jácint Szabó:
The parity problem of polymatroids without double circuits. 679-692 - Michael Molloy:
When does the giant component bring unsatisfiability? 693-734 - Asaf Shapira:
Quasi-randomness and the distribution of copies of a fixed graph. 735-745
a service of 
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 2023-09-30 23:21 CEST 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:
