default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 18, 2009
Volume 18, Numbers 1-2, March 2009
- Noga Alon, Béla Bollobás:
Introduction. 1 - Noga Alon:
Perturbed Identity Matrices Have High Rank: Proof and Applications. 3-15 - József Balogh, Béla Bollobás, Robert Morris:
Majority Bootstrap Percolation on the Hypercube. 17-51 - Robert Berke, Tibor Szabó:
Deciding Relaxed Two-Colourability: A Hardness Jump. 53-81 - Béla Bollobás, Svante Janson, Oliver Riordan:
Line-of-Sight Percolation. 83-106 - Irit Dinur
, Ehud Friedgut:
Intersecting Families are Essentially Contained in Juntas. 107-122 - Benjamin Doerr, Tobias Friedrich:
Deterministic Random Walks on the Two-Dimensional Grid. 123-144 - Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany:
Line-of-Sight Networks. 145-163 - Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Jozef Skokan:
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. 165-203 - Svante Janson:
The Probability That a Random Multigraph is Simple. 205-225 - Nathan Linial, Adi Shraibman:
Learning Complexity vs Communication Complexity. 227-245 - Po-Shen Loh, Benny Sudakov:
Constrained Ramsey Numbers. 247-258 - Martin Marciniszyn, Reto Spöhel, Angelika Steger:
Upper Bounds for Online Ramsey Games in Random Graphs. 259-270 - Martin Marciniszyn, Reto Spöhel, Angelika Steger:
Online Ramsey Games in Random Graphs. 271-300
Volume 18, Number 3, May 2009
- Michael H. Albert, Steve Linton:
Growing at a Perfect Speed. 301-308 - Bálint Felszeghy, Gábor Hegedüs, Lajos Rónyai:
Algebraic Properties of Modulo q Complete l-Wide Families. 309-333 - Ben Green, Terence Tao:
Freiman's Theorem in Finite Fields via Extremal Set Theory. 335-355 - Hamed Hatami:
Decision Trees and Influences of Variables Over Product Probability Spaces. 357-369 - Craig Lennon, Boris G. Pittel:
On the Likely Number of Solutions for the Stable Marriage Problem. 371-421 - Wenbo V. Li, Xinyi Zhang:
On the Difference of Expected Lengths of Minimum Spanning Trees. 423-434 - Allan Siu Lun Lo:
Triangles in Regular Graphs with Density Below One Half. 435-440 - Dhruv Mubayi, Reshma Ramadurai:
Simplex Stability. 441-454 - Vladimir Nikiforov:
A Spectral Erdös-Stone-Bollobás Theorem. 455-458
Volume 18, Number 4, July 2009
- Noga Alon, József Balogh, Alexandr V. Kostochka, Wojciech Samotij:
Sizes of Induced Subgraphs of Ramsey Graphs. 459-476 - Guillaume Chapuy:
Asymptotic Enumeration of Constellations and Related Families of Maps on Orientable Surfaces. 477-516 - Marcos A. Kiwi, José A. Soto:
On a Speculated Relation Between Chvátal-Sankoff Constants of Several Sequences. 517-532 - Paulette Lieby, Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless:
Subgraphs of Random k-Edge-Coloured k-Regular Graphs. 533-549 - Jesús A. De Loera, Jon Lee, Susan Margulies, Shmuel Onn:
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz. 551-582 - Colin McDiarmid:
Random Graphs from a Minor-Closed Class. 583-599 - Criel Merino, Steven D. Noble:
The Equivalence of Two Graph Polynomials and a Symmetric Function. 601-615
Volume 18, Number 5, September 2009
- Graham R. Brightwell:
Introduction. 617-618
- Noga Alon:
Economical Elimination of Cycles in the Torus. 619-627 - József Balogh, Tom Bohman, Dhruv Mubayi:
Erdos-Ko-Rado in Random Hypergraphs. 629-646 - Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger:
The Degree Sequence of Random Graphs from Subcritical Classes. 647-681 - Andrzej Dudek, Peter Frankl, Vojtech Rödl:
A Note on Universal and Canonically Coloured Sequences. 683-689 - György Elekes, Miklós Simonovits, Endre Szabó:
A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have? 691-705 - Stefan Felsner, Kolja B. Knauer:
ULD-Lattices and Delta-Bonds. 707-724 - Zoltán Füredi, Lale Özkahya:
On 14-Cycle-Free Subgraphs of the Hypercube. 725-729 - Jerrold R. Griggs, Linyuan Lu:
On Families of Subsets With a Forbidden Subposet. 731-748 - L. Ilinca, Jeff Kahn:
On the Number of 2-SAT Functions. 749-764 - Hal A. Kierstead, Alexandr V. Kostochka:
Efficient Graph Packing via Game Colouring. 765-774 - Michael Krivelevich, Benny Sudakov, Dan Vilenchik:
On the Random Satisfiable Process. 775-801 - Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht:
On Colourings of Hypergraphs Without Monochromatic Fano Planes. 803-818 - János Pach, Gábor Tardos:
Conflict-Free Colourings of Graphs and Hypergraphs. 819-834 - Marcus Sammer, Prasad Tetali:
Concentration on the Discrete Torus Using Transportation. 835-860
Volume 18, Number 6, November 2009
- Pablo Candela:
Structure Along Arithmetic Patterns in Sequences of Vectors. 861-870 - Javier Cilleruelo, Yahya Ould Hamidoune, Oriol Serra:
On Sums of Dilates. 871-880 - Amin Coja-Oghlan, Elchanan Mossel, Dan Vilenchik:
A Spectral Approach to Analysing Belief Propagation for 3-Colouring. 881-912 - David Conlon:
Hypergraph Packing and Sparse Bipartite Ramsey Numbers. 913-923 - Tobias Müller, Jean-Sébastien Sereni:
Identifying and Locating-Dominating Codes in (Random) Geometric Networks. 925-952 - Hongxun Qin, Daniel C. Slilaty, Xiangqian Zhou:
The Regular Excluded Minors for Signed-Graphic Matroids. 953-978 - Nathan Ross:
Step Size in Stein's Method of Exchangeable Pairs. 979-1017
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-08 20: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:
