default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 17, 2008
Volume 17, Number 1, January 2008
- Alexander I. Barvinok:
Enumerating Contingency Tables via Random Permanents. 1-19 - Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok:
The Distribution of Patterns in Random Trees. 21-59 - Yahya Ould Hamidoune:
On Iterated Image Size for Point-Symmetric Relations. 61-66 - Mihyun Kang
, Taral Guldahl Seierstad:
The Critical Phase for Random Graphs with a Given Degree Sequence. 67-86 - Roberto Oliveira:
Balls-in-Bins Processes with Feedback and Brownian Motion. 87-110 - Oliver Riordan:
The k-Core and Branching Processes. 111-136 - Vincent Vatter:
Enumeration Schemes for Restricted Permutations. 137-159
Volume 17, Number 2, March 2008
- Nicolas Broutin, Luc Devroye:
An Analysis of the Height of Tries with Random Weights on the Edges. 161-202 - Adrian Dumitrescu, Csaba D. Tóth:
On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space. 203-224 - Roberto Fernández, Aldo Procacci:
Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree. 225-238 - Raymond Hemmecke, Jason Morton, Anne Shiu, Bernd Sturmfels, Oliver Wienand:
Three Counter-Examples on Semi-Graphoids. 239-257 - Svante Janson, Andrew Thomason:
Dismantling Sparse Random Graphs. 259-264 - Hal A. Kierstead, Alexandr V. Kostochka:
A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring. 265-270 - Po-Shen Loh, Benny Sudakov:
On the Strong Chromatic Number of Random Graphs. 271-286 - Vadim V. Lozin:
Boundary Classes of Planar Graphs. 287-295 - T. Sanders:
A Note on Freiman's Theorem in Vector Spaces. 297-305 - R. O. Y. Wagner:
Tail Estimates for Sums of Variables Sampled by a Random Walk. 307-316 - Hans-Otto Georgii:
The Random-Cluster Model, by Geoffrey Grimmett, Springer, 2006. 317-318
Volume 17, Number 3, May 2008
- Noga Alon, Oded Schwartz, Asaf Shapira:
An Elementary Construction of Constant-Degree Expanders. 319-327 - Jean Bertoin:
Two-Parameter Poisson-Dirichlet Measures and Reversible Exchangeable Fragmentation-Coalescence Processes. 329-337 - Arturas Dubickas:
An Approximation by Lacunary Sequence of Vectors. 339-345 - Shmuel Friedland, Leonid Gurvits:
Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer-Dimer Entropy. 347-361 - W. T. Gowers:
Quasirandom Groups. 363-387 - Carlos Hoppen, Nicholas C. Wormald:
Induced Forests in Regular Graphs with Large Girth. 389-410 - Daniela Kühn, Deryk Osthus:
Linkedness and Ordered Cycles in Digraphs. 411-422 - Charles Semple, Dominic Welsh:
Negative Correlation in Graphs and Matroids. 423-435 - Jim X. Zhang, Paul Dupuis:
Large-Deviation Approximations for General Occupancy Models. 437-470
Volume 17, Number 4, July 2008
- Peter Allen:
Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles. 471-486 - Itai Benjamini, Noam Berger, Ariel Yadin:
Long-Range Percolation Mixing Time. 487-494 - Charlotte A. C. Brennan, Arnold Knopfmacher, Stephan G. Wagner:
The Distribution of Ascents of Size d or More in Partitions of n. 495-509 - Clifford C. Cocks:
Correlated Matroids. 511-518 - Roland Häggkvist, Anders Johansson:
Orthogonal Latin Rectangles. 519-536 - Gerard Hooghiemstra, Piet Van Mieghem:
The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights. 537-548 - Jerzy Jaworski, Dudley Stark:
The Vertex Degree Distribution of Passive Random Intersection Graph Models. 549-558 - J. Robert Johnson, John M. Talbot:
G-Intersection Theorems for Matchings and Other Graphs. 559-575 - Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos:
Graph Colouring with No Large Monochromatic Components. 577-589 - Colin McDiarmid, Bruce A. Reed:
On the Maximum Degree of a Random Planar Graph. 591-601 - Alexander A. Razborov:
On the Minimal Density of Triangles in Graphs. 603-618 - József Solymosi, Csaba D. Tóth:
On a Question of Bourgain about Geometric Incidences. 619-625
Volume 17, Number 5, September 2008
- Boris Bukh:
Sums of Dilates. 627-639 - Yannick Frein, Benjamin Lévêque, András Sebö:
Generating All Sets With Bounded Unions. 641-660 - Michael Fuchs:
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations. 661-680 - Ron Holzman, Vsevolod F. Lev, Rom Pinchasi:
Projecting Difference Sets on the Positive Orthant. 681-688 - Luke Kelly, Daniela Kühn, Deryk Osthus:
A Dirac-Type Result on Hamilton Cycles in Oriented Graphs. 689-709 - Russell Lyons, R. O. N. Peled, Oded Schramm:
Growth of the Number of Spanning Trees of the Erdös-Rényi Giant Component. 711-726
Volume 17, Number 6, November 2008
- Jomy Alappattu, Jim Pitman:
Coloured Loop-Erased Random Walk on the Complete Graph. 727-740 - Javier Cilleruelo, Carlos Vinuesa:
B2[ g] Sets and a Conjecture of Schinzel and Schmidt. 741-747 - Feng Ming Dong, Khee Meng Koh:
Bounds For The Real Zeros of Chromatic Polynomials. 749-759 - Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
Dobrushin Conditions and Systematic Scan. 761-779 - Ohad N. Feldheim, Michael Krivelevich:
Winning Fast in Sparse Graph Construction Games. 781-791 - Yahya Ould Hamidoune:
A Weighted Generalization of Gao's n + D - 1 Theorem. 793-798 - Svante Janson:
Individual Displacements in Hashing with Coalesced Chains. 799-814 - Ken-ichi Kawarabayashi:
A Weakening of the Odd Hadwiger's Conjecture. 815-821 - Alexandr V. Kostochka, Dhruv Mubayi:
When is an Almost Monochromatic K4 Guaranteed? 823-830 - Thomas M. Lewis:
The Hitting Time for the Height of a Random Recursive Tree. 831-835 - Elizabeth R. Moseman, Peter Winkler:
On a Form of Coordinate Percolation. 837-845
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-20 20:49 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:
