- 2017
- Ron Aharoni, David M. Howard:
A Rainbow r-Partite Version of the Erdős-Ko-Rado Theorem. Comb. Probab. Comput. 26(3): 321-337 (2017) - Victor Bapst, Amin Coja-Oghlan, Charilaos Efthymiou:
Planting Colourings Silently. Comb. Probab. Comput. 26(3): 338-366 (2017) - Vitaly Bergelson, Donald Robertson
, Pavel Zorin-Kranich:
Triangles in Cartesian Squares of Quasirandom Groups. Comb. Probab. Comput. 26(2): 161-182 (2017) - Shankar Bhamidi, Remco van der Hofstad:
Diameter of the Stochastic Mean-Field Model of Distance. Comb. Probab. Comput. 26(6): 797-825 (2017) - Axel Brandt, David Irwin, Tao Jiang:
Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians. Comb. Probab. Comput. 26(3): 367-405 (2017) - Boris Bukh, Zilin Jiang:
A Bound on the Number of Edges in Graphs Without an Even Cycle. Comb. Probab. Comput. 26(1): 1-15 (2017) - Boris Bukh, Zilin Jiang:
Erratum For 'A Bound on the Number of Edges in Graphs Without an Even Cycle'. Comb. Probab. Comput. 26(6): 952-953 (2017) - Emma Cohen, Will Perkins, Prasad Tetali:
On the Widom-Rowlinson Occupancy Fraction in Regular Graphs. Comb. Probab. Comput. 26(2): 183-194 (2017) - David Conlon:
A Sequence of Triangle-Free Pseudorandom Graphs. Comb. Probab. Comput. 26(2): 195-200 (2017) - A. Davidson, Ayalvadi Ganesh:
Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance. Comb. Probab. Comput. 26(6): 826-838 (2017) - A. Nicholas Day:
Saturated Graphs of Prescribed Minimum Degree. Comb. Probab. Comput. 26(2): 201-207 (2017) - Adrian Dumitrescu, Csaba D. Tóth:
Convex Polygons in Geometric Triangulations. Comb. Probab. Comput. 26(5): 641-659 (2017) - Lorenzo Federico, Remco van der Hofstad:
Critical Window for Connectivity in the Configuration Model. Comb. Probab. Comput. 26(5): 660-680 (2017) - Ohad N. Feldheim:
Monotonicity of Avoidance Coupling on KN. Comb. Probab. Comput. 26(1): 16-23 (2017) - Asaf Ferber, Kyle Luh, Daniel Montealegre, Oanh Nguyen:
Packing Loose Hamilton Cycles. Comb. Probab. Comput. 26(6): 839-849 (2017) - Jacob Fox, László Miklós Lovász, Yufei Zhao:
On Regularity Lemmas and their Algorithmic Applications. Comb. Probab. Comput. 26(4): 481-505 (2017) - Peter Frankl:
A Stability Result for Families with Fixed Diameter. Comb. Probab. Comput. 26(4): 506-516 (2017) - Peter Frankl, Andrey Kupavskii:
Uniform s-Cross-Intersecting Families. Comb. Probab. Comput. 26(4): 517-524 (2017) - Zoltán Füredi, Zeinab Maleki:
The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs. Comb. Probab. Comput. 26(4): 525-535 (2017) - Wei Gao, Jie Han:
Minimum Codegree Threshold for C 6 3-Factors in 3-Uniform Hypergraphs. Comb. Probab. Comput. 26(4): 536-559 (2017) - Marcelo M. Gauy, Hiêp Hàn, Igor C. Oliveira:
Erdős-Ko-Rado for Random Hypergraphs: Asymptotics and Stability. Comb. Probab. Comput. 26(3): 406-422 (2017) - António Girão, Teeradej Kittipassorn, Kamil Popielarz:
Generalized Majority Colourings of Digraphs. Comb. Probab. Comput. 26(6): 850-855 (2017) - Roman Glebov, Humberto Naves, Benny Sudakov:
The Threshold Probability for Long Cycles. Comb. Probab. Comput. 26(2): 208-247 (2017) - Ben Green:
On the Chromatic Number of Random Cayley Graphs. Comb. Probab. Comput. 26(2): 248-266 (2017) - Jie Han, Allan Lo, Andrew Treglown, Yi Zhao:
Exact Minimum Codegree Threshold for K - 4-Factors. Comb. Probab. Comput. 26(6): 856-885 (2017) - Jianfeng Hou, Qinghou Zeng:
Judicious Partitioning of Hypergraphs with Edges of Size at Most 2. Comb. Probab. Comput. 26(2): 267-284 (2017) - Svante Janson:
Patterns in Random Permutations Avoiding the Pattern 132. Comb. Probab. Comput. 26(1): 24-51 (2017) - J. Robert Johnson, Trevor Pinto:
Saturated Subgraphs of the Hypercube. Comb. Probab. Comput. 26(1): 52-67 (2017) - Peter Keevash, William Lochet:
The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours. Comb. Probab. Comput. 26(6): 886-910 (2017) - Igor Kortchemski, Cyril Marzouk:
Simply Generated Non-Crossing Partitions. Comb. Probab. Comput. 26(4): 560-592 (2017)
