Volume 26, Number 1-2, January/ March 2005

• 
  Béla Bollobás, Svante Janson, Oliver Riordan: The phase transition in the uniformly grown random graph has infinite order. 1-36
• 
  Ehud Friedgut: Hunting for sharp thresholds. 37-51
• 
  Ravi Montenegro: Vertex and edge expansion properties for rapid mixing. 52-68
• 
  Svante Janson: Asymptotic degree distribution in random recursive trees. 69-83
• 
  Alois Panholzer: The climbing depth of random trees. 84-109
• 
  Raphael Yuster: Integer and fractional packing of families of graphs. 110-118
• 
  Jeong Han Kim, Oleg Pikhurko, Joel H. Spencer, Oleg Verbitsky: How complex are random graphs in first order logic? 119-145
• 
  Ron Blei, Fuchang Gao: Combinatorial dimension in fractional Cartesian products. 146-159
• 
  Vojtech Rödl, Jozef Skokan: Counting subgraphs in quasi-random 4-uniform hypergraphs. 160-203
• 
  Milos Stojakovic, Tibor Szabó: Positional games on random graphs. 204-223
• 
  Jerzy Szymanski: Concentration of vertex degrees in a scale-free random graph process. 224-236
• 
  Johan Wästlund: A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment. 237-251

Volume 26, Number 3, May 2005

• 
  Benny Sudakov: Large Kr-free subgraphs in Ks-free graphs and some other Ramsey-type problems. 253-265
• 
  Martin Dietzfelbinger, Hisao Tamaki: On the probability of rendezvous in graphs. 266-288
• 
  Eldar Fischer: Testing graphs for colorability properties. 289-309
• 
  Paul N. Balister, Béla Bollobás, Anthony Quas: Percolation in Voronoi tilings. 310-318
• 
  Alan M. Frieze: Perfect matchings in random bipartite graphs with minimal degree at least 2. 319-358

Volume 26, Number 4, July 2005

• 
  James Allen Fill, Nevin Kapur: Transfer theorems and asymptotic distributional results for m-ary search trees. 359-391
• 
  Paul N. Balister, Béla Bollobás, Mark Walters: Continuum percolation with steps in the square or the disc. 392-403
• 
  Hua-Huai Chern, Hsien-Kuei Hwang: Limit distribution of the number of consecutive records. 404-417
• 
  Elchanan Mossel, Ryan O'Donnell: Coin flipping from a cosmic source: On error correction of truly random bits. 418-436
• 
  András Lukács: Generating random elements of abelian groups. 437-445
• 
  Aris Anagnostopoulos, Ioannis Kontoyiannis, Eli Upfal: Steady state analysis of balanced-allocation routing. 446-467

last updated on Sat May 25 06:36:35 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page