- Bill Jackson:
Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs. Comb. Probab. Comput. 16(1): 85-108 (2007) - Svante Janson:
On a Random Graph Related to Quantum Theory. Comb. Probab. Comput. 16(5): 757-766 (2007) - Svante Janson, Joel Spencer:
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution. Comb. Probab. Comput. 16(4): 631-658 (2007) - Jeff Kahn, Gil Kalai:
Thresholds and Expectation Thresholds. Comb. Probab. Comput. 16(3): 495-502 (2007) - Hemanshu Kaul, Alexandr V. Kostochka:
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer. Comb. Probab. Comput. 16(3): 409-416 (2007) - Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte:
Rainbow Turán Problems. Comb. Probab. Comput. 16(1): 109-126 (2007) - János Körner, Blerina Sinaimeri:
On Cancellative Set Families. Comb. Probab. Comput. 16(5): 767-773 (2007) - Alexandr V. Kostochka, Gexin Yu:
Ore-type graph packing problems. Comb. Probab. Comput. 16(1): 167-169 (2007) - Daniela Kühn, Deryk Osthus:
Maximizing Several Cuts Simultaneously. Comb. Probab. Comput. 16(2): 277-283 (2007) - Svante Linusson, Johan Wästlund:
Completing a (k - 1)-Assignment. Comb. Probab. Comput. 16(4): 621-629 (2007) - Régine Marchand, Elahe Zohoorian Azad:
Limit Law of the Length of the Standard Right Factor of a Lyndon Word. Comb. Probab. Comput. 16(3): 417-434 (2007) - András Máthé:
The Angel of Power 2 Wins. Comb. Probab. Comput. 16(3): 363-374 (2007) - William D. May, John C. Wierman:
The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds. Comb. Probab. Comput. 16(2): 285-307 (2007) - Martin Möhle:
On a Class of Non-Regenerative Sampling Distributions. Comb. Probab. Comput. 16(3): 435-444 (2007) - Eran Ofek:
On the Expansion of the Giant Component in Percolated (n, d, lambda) Graphs. Comb. Probab. Comput. 16(3): 445-457 (2007) - Luke Pebody:
Reconstructing Odd Necklaces. Comb. Probab. Comput. 16(4): 503-514 (2007) - Jan Remy, Alexander Souza, Angelika Steger:
On an Online Spanning Tree Problem in Randomly Weighted Graphs. Comb. Probab. Comput. 16(1): 127-144 (2007) - Vojtech Rödl, Mathias Schacht:
Regular Partitions of Hypergraphs: Regularity Lemmas. Comb. Probab. Comput. 16(6): 833-885 (2007) - Vojtech Rödl, Mathias Schacht:
Regular Partitions of Hypergraphs: Counting Lemmas. Comb. Probab. Comput. 16(6): 887-901 (2007) - Tomasz Schoen:
Difference Covers. Comb. Probab. Comput. 16(5): 775-787 (2007) - Lingsheng Shi, Nicholas C. Wormald:
Colouring Random 4-Regular Graphs. Comb. Probab. Comput. 16(2): 309-344 (2007) - Lingsheng Shi, Nicholas C. Wormald:
Colouring Random Regular Graphs. Comb. Probab. Comput. 16(3): 459-494 (2007) - Mike A. Steel, László A. Székely:
Teasing Apart Two Trees. Comb. Probab. Comput. 16(6): 903-922 (2007) - C. R. Subramanian:
List Set Colouring: Bounds and Algorithms. Comb. Probab. Comput. 16(1): 145-158 (2007) - Ádám Timár:
Cutsets in Infinite Graphs. Comb. Probab. Comput. 16(1): 159-166 (2007) - Mark Walters:
Extensions of the Polynomial Hales-Jewett Theorem. Comb. Probab. Comput. 16(5): 789-803 (2007) - Raphael Yuster:
Packing Cliques in Graphs with Independence Number 2. Comb. Probab. Comput. 16(5): 805-817 (2007)