default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 40
Volume 40, Number 1, January 2012
- David Conlon
, Hiêp Hàn, Yury Person, Mathias Schacht:
Weak quasi-randomness for uniform hypergraphs. 1-38 - Fan Chung Graham:
Quasi-random hypergraphs revisited. 39-48 - Domingos Dellamonica Jr.:
The size-Ramsey number of trees. 49-73 - Ariel Gabizon, Ronen Shaltiel:
Increasing the output length of zero-error dispersers. 74-104 - Asaf Shapira, Raphael Yuster:
The quasi-randomness of hypergraph cut properties. 105-131
Volume 40, Number 2, March 2012
- Fiachra Knox, Daniela Kühn, Deryk Osthus:
Approximate Hamilton decompositions of random graphs. 133-149 - Elisabetta Candellero, Lorenz A. Gilch:
Phase transitions for random walk asymptotics on free products of groups. 150-181 - André Galligo, Laurent Miclo:
On the cut-off phenomenon for the transitivity of randomly generated subgroups. 182-219 - Jacob van den Berg, Bernardo N. B. de Lima, Pierre Nolin:
A percolation process on the square lattice where large finite clusters are frozen. 220-226 - Dmitry A. Shabanov:
Random coloring method in the combinatorial problem of Erdős and Lovász. 227-253 - Guy Wolfovitz:
A concentration result with application to subgraph count. 254-267
Volume 40, Number 3, May 2012
- Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Packing tight Hamilton cycles in 3-uniform hypergraphs. 269-300 - Wojciech Banaszczyk:
On series of signed vectors and their rearrangements. 301-316 - Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger:
The fraction of large random trees representing a given Boolean function in implicational logic. 317-349 - Ilan Gronau, Shlomo Moran, Sagi Snir:
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges. 350-384 - Paul Horn, Mary Radcliffe:
Giant components in Kronecker graphs. 385-397
Volume 40, Number 4, July 2012
- Mokshay M. Madiman, Adam W. Marcus, Prasad Tetali:
Entropy and set cardinality inequalities for partition-determined functions. 399-424 - Julia Böttcher, Yoshiharu Kohayakawa, Aldo Procacci:
Properly coloured copies and rainbow copies of large graphs with small maximum degree. 425-436 - Sourav Chatterjee:
The missing log in large deviations for triangle counts. 437-451 - Bobby DeMarco, Jeff Kahn:
Upper tails for triangles. 452-459 - Lincoln Chayes, S. Alex Smith:
Large deviation analysis for layered percolation problems on the complete graph. 460-492 - Andrzej Dudek, Reshma Ramadurai, Vojtech Rödl:
On induced Folkman numbers. 493-500 - Markus Jalsenius:
Sampling colourings of the triangular lattice. 501-533
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-12-12 22:54 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:
