default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 32
Volume 32, Number 1, January 2012
- Omer Angel, Abraham D. Flaxman, David B. Wilson:
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks. 1-33 - Jop Briët, Sourav Chakraborty, David García-Soriano
, Arie Matsliah:
Monotonicity testing and shortest-path routing on the cube. 35-53 - Dustin Cartwright, Melody Chan:
Three notions of tropical rank for symmetric matrices. 55-84 - Eryk Kopczynski, Igor Pak, Piotr Przytycki:
Acute triangulations of polyhedra and ℝ N. 85-110 - Andrei M. Raigorodskii:
On the chromatic numbers of spheres in ℝ n. 111-123
Volume 32, Number 2, March 2012
- Paul Balister, Béla Bollobás:
Projections, entropy and sumsets. 125-141 - József Balogh, Dhruv Mubayi:
Almost all triangle-free triple systems are tripartite. 143-169 - David Conlon:
On the Ramsey multiplicity of complete graphs. 171-186 - Ervin Györi, Nathan Lemons:
3-uniform hypergraphs avoiding a given odd cycle. 187-203 - Hao Huang, Benny Sudakov:
A counterexample to the Alon-Saks-Seymour conjecture and related problems. 205-219 - Marcus Isaksson, Guy Kindler, Elchanan Mossel:
The geometry of manipulation - A quantitative proof of the Gibbard-Satterthwaite theorem. 221-250
Volume 32, Number 3, April 2012
- Maria Chudnovsky, Paul D. Seymour:
Packing seagulls. 251-282 - Maria Chudnovsky, Sang-il Oum, Paul D. Seymour:
Finding minimum clique capacity. 283-287 - Fedor V. Fomin, Yngve Villanger:
Treewidth computation and extremal combinatorics. 289-308 - Jan-Christoph Schlage-Puchta:
Applications of character estimates to statistical problems for the symmetric group. 309-323 - Saharon Shelah:
Universality among graphs omitting a complete bipartite graph. 325-362 - Terence Tao, Van H. Vu:
The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi. 363-372
Volume 32, Number 4, April 2012
- Attila Bernáth, Tamás Király:
A unifying approach to splitting-off. 373-401 - Maria Chudnovsky, Paul D. Seymour:
Perfect matchings in planar cubic graphs. 403-424 - Péter Csikvári, Katalin Gyarmati, András Sárközy:
Density and ramsey type results on algebraic equations with restricted solution sets. 425-449 - John Haslegrave:
The Bollobás-Thomason conjecture for 3-uniform hypergraphs. 451-471 - János Pach, Gábor Tardos, József Solymosi:
Remarks on a Ramsey theory for trees. 473-482 - Florian Pfender:
Complete subgraphs in multipartite graphs. 483-495
Volume 32, Number 5, May 2012
- Javier Cilleruelo:
Combinatorial problems in finite fields and Sidon sets. 497-511 - David Conlon, Jacob Fox, Benny Sudakov:
On two problems in graph Ramsey theory. 513-535 - György Elekes, Endre Szabó:
How to find groups? (and how to use them in Erdős geometry?). 537-571 - Heidi Gebauer:
Disproof of the neighborhood conjecture with implications to SAT. 573-587 - Géza Kós, Lajos Rónyai:
Alon's Nullstellensatz for multisets. 589-605 - Shachar Lovett:
Equivalence of polynomial conjectures in additive combinatorics. 607-618
Volume 32, Number 6, December 2012
- Jacob Fox, Po-Shen Loh:
On a problem of Erdös and Rothschild on edges in triangles. 619-628 - Nick Gravin, Sinai Robins, Dmitry Shiryaev:
Translational tilings by a polytope, with multiplicity. 629-649 - Matthias Hamann, Julian Pott:
Transitivity conditions in infinite graphs. 649-688 - Roman N. Karasev:
Analogues of the central point theorem for families with d-intersection property in ℝ d. 689-702 - Tamás Király, Lap Chi Lau, Mohit Singh:
Degree bounded matroids and submodular flows. 703-720 - Giorgis Petridis:
New proofs of Plünnecke-type estimates for product sets in groups. 721-733 - Hajime Tanaka:
The Erdös-Ko-Rado theorem for twisted Grassmann graphs. 735-740
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-10-31 20:18 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:
