default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 41
Volume 41, Number 1, August 2012
- Alan M. Frieze
, Michael Krivelevich:
Packing hamilton cycles in random and pseudo-random hypergraphs. 1-22 - Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich:
Hitting time results for Maker-Breaker games. 23-46 - Demetres Christofides, Klas Markström:
Random Latin square graphs. 47-65 - Luc Devroye, Omar Fawzi, Nicolas Fraiman:
Depth Properties of scaled attachment random recursive trees. 66-98 - Hamed Hatami, Michael Molloy:
The scaling window for a random graph with a given degree sequence. 99-123 - Hao Huang, Choongbum Lee:
Quasi-randomness of graph balanced cut properties. 124-145
Volume 41, Number 2, September 2012
- Graham R. Brightwell, Konstantinos Panagiotou, Angelika Steger:
Extremal subgraphs of random graphs. 147-178 - Tom Bohman, Michael E. Picollelli:
SIR epidemics on random graphs with a fixed degree sequence. 179-214 - Nicolas Broutin, Philippe Flajolet:
The distribution of height and diameter in random non-plane binary trees. 215-252 - Louigi Addario-Berry:
Tail bounds for the height and width of a random tree with a given degree sequence. 253-261 - Jeff Kahn, M. Neiman:
Conditional negative association for competing urns. 262-281 - Tomás Kulich:
The diameter of a random subgraph of the hypercube. 282-291
Volume 41, Number 3, October 2012
- Choongbum Lee, Benny Sudakov:
Dirac's theorem for random graphs. 293-305 - Nikolaos Fountoulakis, Konstantinos Panagiotou:
Sharp load thresholds for cuckoo hashing. 306-333 - Alan M. Frieze, Páll Melsted:
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables. 334-364 - Balázs Ráth:
Time evolution of dense multigraph limits under edge-conservative preferential attachment dynamics. 365-390
Volume 41, Number 4, December 2012
- Dan Hefetz, Michael Krivelevich, Tibor Szabó:
Sharp threshold for the appearance of certain spanning trees in random graphs. 391-412 - József Balogh, Béla Bollobás, Robert Morris:
Graph bootstrap percolation. 413-440 - Béla Bollobás, Oliver Riordan:
Asymptotic normality of the size of the giant component in a random hypergraph. 441-450 - Fan Chung Graham, Stephen J. Young, Wenbo Zhao:
Braess's paradox in expanders. 451-468 - Bobby DeMarco, Jeff Kahn:
Tight upper tail bounds for cliques. 469-487 - Luca Gugelmann, Yury Person, Angelika Steger, Henning Thomas:
A randomized version of Ramsey's theorem. 488-505 - Frantisek Kardos, Daniel Král', Jan Volec:
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs. 506-520 - Linyuan Lu, Xing Peng:
Loose laplacian spectra of random hypergraphs. 521-545 - Wesley Pegden:
The lefthanded local lemma characterizes chordal dependency graphs. 546-556 - Vojtech Rödl, Mathias Schacht:
Complete Partite subgraphs in dense hypergraphs. 557-573
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:
