default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 15, 2006
Volume 15, Numbers 1-2, January 2006
- Noga Alon, Yoshiharu Kohayakawa
, Christian Mauduit, Carlos Gustavo T. de A. Moreira, Vojtech Rödl:
Measures of Pseudorandomness for Finite Sequences: Minimal Values. 1-29 - Richard Arratia, Andrew D. Barbour, Simon Tavaré:
A Tale of Three Couplings: Poisson-Dirichlet and GEM Approximations for Random Permutations. 31-62 - Christian Borgs:
Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs. 63-74 - Henning Bruhn, Reinhard Diestel:
Duality in Infinite Graphs. 75-90 - Peter J. Cameron, Jaroslav Nesetril:
Homomorphism-Homogeneous Relational Structures. 91-103 - Edward Dobson:
Automorphism Groups of Metacirculant Graphs of Order a Product of Two Distinct Primes. 105-130 - Zoltán Füredi, Gyula O. H. Katona:
2-Bases of Quadruples. 131-141 - W. T. Gowers:
Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs. 143-184 - Ervin Györi:
Triangle-Free Hypergraphs. 185-191 - Penny E. Haxell, Tibor Szabó:
Odd Independent Transversals are Odd. 193-211 - Ayman Khalfalah, Endre Szemerédi:
On the Number of Monochromatic Solutions of ${\bm x}+{\bm y}={\bm z}^{{\bm 2}}$. 213-227 - Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
A Dirac-Type Theorem for 3-Uniform Hypergraphs. 229-251 - Alexander D. Scott, Alan D. Sokal:
On Dependency Graphs and the Lattice Gas. 253-279 - Alexander D. Scott, Gregory B. Sorkin:
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time. 281-315
Volume 15, Number 3, May 2006
- Alon Amit, Nathan Linial:
Random Lifts of Graphs: Edge Expansion. 317-332 - Manuel Bodirsky, Mihyun Kang:
Generating Outerplanar Graphs Uniformly at Random. 333-343 - Maria Deijfen, Olle Häggström:
The Initial Configuration is Irrelevant for the Possibility of Mutual Unbounded Growth in the Two-Type Richardson Model. 345-353 - Guoli Ding, Jinko Kanno:
Splitter Theorems for Cubic Graphs. 355-375 - G. E. Farr:
The Complexity of Counting Colourings of Subgraphs of the Grid. 377-383 - Omer Giménez, Marc Noy:
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids. 385-395 - Petr Hlinený:
The Tutte Polynomial for Matroids of Bounded Branch-Width. 397-409 - Russell A. Martin, Dana Randall:
Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs. 411-448 - Steven D. Noble:
Evaluating the Rank Generating Function of a Graphic 2-Polymatroid. 449-461 - Thomas Voigt, Günter M. Ziegler:
Singular 0/1-Matrices, and the Hyperplanes Spanned by Random 0/1-Vectors. 463-471 - Jirí Matousek, Ales Prívetivý:
The Minimum Independence Number of a Hasse Diagram. 473-475
Volume 15, Number 4, July 2006
- Sven Erick Alm:
On Measures of Average Degree for Lattices. 477-488 - Tom Bohman, David Kravitz:
Creating a Giant Component. 489-511 - William Duckworth, Nicholas C. Wormald:
On the Independent Domination Number of Random Regular Graphs. 513-522 - Luis A. Goddyn, Petr Hlinený, Winfried Hochstättler:
Balanced Signings and the Chromatic Number of Oriented Matroids. 523-539 - Ravi Kannan, László Lovász, Ravi Montenegro:
Blocking Conductance and Mixing in Random Walks. 541-570 - Christopher Malon, Igor Pak:
Percolation on Finite Cayley Graphs. 571-588 - Serban Nacu:
Increments of Random Partitions. 589-595 - József Solymosi:
Arithmetic Progressions in Sets with Small Sumsets. 597-603 - Donald K. Wagner:
Weakly 3-Connected Graphs. 605-617 - Peter Wagner:
An Upper Bound for Constrained Ramsey Numbers. 619-626 - Aart Blokhuis:
Jaeger's Conjecture. 627-629 - Edward Odell:
Ramsey Methods in Analysis, by Spiros A. Argyros and Stevo Todorcevic, Birkhäuser 2005. 631-636
Volume 15, Number 5, September 2006
- Colin Cooper:
Distribution of Vertex Degree in Web-Graphs. 637-661 - Idris David Mercer:
Autocorrelations of Random Binary Sequences. 663-671 - Itai Benjamini, Gady Kozma, László Lovász, Dan Romik, Gábor Tardos:
Waiting for a Bat to Fly By (in Polynomial Time). 673-683 - Ken-ichi Kawarabayashi, Alexandr V. Kostochka, Gexin Yu:
On Sufficient Degree Conditions for a Graph to be k-linked. 685-694 - Remco van der Hofstad, Gordon Slade:
Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms. 695-713 - József Balogh, Yuval Peres, Gábor Pete:
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups. 715-730 - Amin Coja-Oghlan:
Finding Large Independent Sets in Polynomial Expected Time. 731-751 - William Paulsen:
Best Odds for Finding a Perfect Matching in a Bipartite Graph. 753-763 - Youngbin Choe, David G. Wagner:
Rayleigh Matroids. 765-781 - Noga Alon:
Feasible Schedules for Rotating Transmissions. 783-787 - Bruce C. Berndt:
Integer Partitions, by George E. Andrews and Kimmo Eriksson, Cambridge University Press 2004. 789-790
Volume 15, Number 6, November 2006
- Noga Alon, Asaf Shapira:
A Characterization of Easily Testable Induced Subgraphs. 791-805 - Mathias Beiglböck:
A Multidimensional Central Sets Theorem. 807-814 - Joshua N. Cooper, Joel Spencer:
Simulating a Random Walk with Constant Error. 815-822 - Gianluca De Marco, Andrzej Pelc:
Randomized Algorithms for Determining the Majority on Graphs. 823-834 - Joanna A. Ellis-Monaghan, Lorenzo Traldi:
Parametrized Tutte Polynomials of Graphs and Matroids. 835-854 - Stasys Jukna:
On Graph Complexity. 855-876 - Bojan Mohar, Andrej Vodopivec:
On Polyhedral Embeddings of Cubic Graphs. 877-893 - Vladimir Nikiforov:
Edge Distribution of Graphs with Few Copies of a Given Graph. 895-902 - Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem:
Size and Weight of Shortest Path Trees with Exponential Link Weights. 903-926 - Paul Wollan:
Extremal Functions for Shortening Sets of Paths. 927-932 - Noga Alon:
Splitting digraphs. 933-937 - Bojan Mohar:
Graphs on Surfaces and Their Applications, by Sergei K. Lando and Alexander K. Zvonkin, Encyclopaedia of Mathematical Sciences 141, Springer-Verlag, 2004. 939-941 - Imre Bárány:
Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, by Stefan Felsner, Vieweg Verlag, 2004. 941-942
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-10-22 02:19 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:
