default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 26
Volume 26, Number 1, January 2017
- Boris Bukh, Zilin Jiang
:
A Bound on the Number of Edges in Graphs Without an Even Cycle. 1-15 - Ohad N. Feldheim:
Monotonicity of Avoidance Coupling on KN. 16-23 - Svante Janson:
Patterns in Random Permutations Avoiding the Pattern 132. 24-51 - J. Robert Johnson, Trevor Pinto:
Saturated Subgraphs of the Hypercube. 52-67 - Eoin Long:
Large Unavoidable Subtournaments. 68-77 - Natasha Morrison, Jonathan A. Noel, Alex Scott:
Saturation in the Hypercube and Bootstrap Percolation. 78-98 - János Pach, Frank de Zeeuw:
Distinct Distances on Algebraic Curves in the Plane. 99-117 - Greta Panova, David Bruce Wilson:
Pfaffian Formulas for Spanning Tree Probabilities. 118-137 - Oleg Pikhurko, Alexander A. Razborov:
Asymptotic Structure of Graphs with the Minimum Number of Triangles. 138-160
Volume 26, Number 2, March 2017
- Vitaly Bergelson, Donald Robertson, Pavel Zorin-Kranich:
Triangles in Cartesian Squares of Quasirandom Groups. 161-182 - Emma Cohen, Will Perkins, Prasad Tetali:
On the Widom-Rowlinson Occupancy Fraction in Regular Graphs. 183-194 - David Conlon:
A Sequence of Triangle-Free Pseudorandom Graphs. 195-200 - A. Nicholas Day:
Saturated Graphs of Prescribed Minimum Degree. 201-207 - Roman Glebov, Humberto Naves, Benny Sudakov:
The Threshold Probability for Long Cycles. 208-247 - Ben Green:
On the Chromatic Number of Random Cayley Graphs. 248-266 - Jianfeng Hou, Qinghou Zeng:
Judicious Partitioning of Hypergraphs with Edges of Size at Most 2. 267-284 - Russell Lyons:
Factors of IID on Trees. 285-300 - Yufei Zhao:
On the Lower Tail Variational Problem for Random Graphs. 301-320
Volume 26, Number 3, May 2017
- Ron Aharoni, David M. Howard:
A Rainbow r-Partite Version of the Erdős-Ko-Rado Theorem. 321-337 - Victor Bapst, Amin Coja-Oghlan, Charilaos Efthymiou:
Planting Colourings Silently. 338-366 - Axel Brandt, David Irwin, Tao Jiang:
Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians. 367-405 - Marcelo M. Gauy, Hiêp Hàn, Igor C. Oliveira:
Erdős-Ko-Rado for Random Hypergraphs: Asymptotics and Stability. 406-422 - Hong Liu, Maryam Sharifzadeh, Katherine Staden:
Local Conditions for Exponentially Many Subdivisions. 423-430 - Dániel T. Nagy:
On the Number of 4-Edge Paths in Graphs With Given Edge Density. 431-447 - Guillem Perarnau, Bruce A. Reed:
Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree. 448-467 - Alex Samorodnitsky:
An Inequality for Functions on the Hamming Cube. 468-480
Volume 26, Number 4, July 2017
- Jacob Fox, László Miklós Lovász, Yufei Zhao:
On Regularity Lemmas and their Algorithmic Applications. 481-505 - Peter Frankl:
A Stability Result for Families with Fixed Diameter. 506-516 - Peter Frankl, Andrey Kupavskii:
Uniform s-Cross-Intersecting Families. 517-524 - Zoltán Füredi, Zeinab Maleki:
The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs. 525-535 - Wei Gao, Jie Han:
Minimum Codegree Threshold for C 6 3-Factors in 3-Uniform Hypergraphs. 536-559 - Igor Kortchemski, Cyril Marzouk:
Simply Generated Non-Crossing Partitions. 560-592 - Abhishek Methuku, Dömötör Pálvölgyi:
Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems. 593-602 - James Norris, Yuval Peres, Alex Zhai:
Surprise Probabilities in Markov Chains. 603-627 - Aner Shalev:
Mixing, Communication Complexity and Conjectures of Gowers and Viola. 628-640
Volume 26, Number 5, September 2017
- Adrian Dumitrescu, Csaba D. Tóth:
Convex Polygons in Geometric Triangulations. 641-659 - Lorenzo Federico, Remco van der Hofstad:
Critical Window for Connectivity in the Configuration Model. 660-680 - Russell Lyons:
Comparing Graphs of Different Sizes. 681-696 - Colin McDiarmid, Kerstin Weller:
Bridge-Addability, Edge-Expansion and Connectivity. 697-719 - Luka Milicevic:
Sets in Almost General Position. 720-745 - Ori Parzanchevski:
Mixing in High-Dimensional Expanders. 746-761 - Trevor Pinto:
The Proofs of Two Directed Paths Conjectures of Bollobás and Leader. 762-774 - Raphael Yuster:
On the Maximum Number of Spanning Copies of an Orientation in a Tournament. 775-796
Volume 26, Number 6, November 2017
- Shankar Bhamidi, Remco van der Hofstad:
Diameter of the Stochastic Mean-Field Model of Distance. 797-825 - A. Davidson, Ayalvadi Ganesh:
Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance. 826-838 - Asaf Ferber, Kyle Luh, Daniel Montealegre, Oanh Nguyen:
Packing Loose Hamilton Cycles. 839-849 - António Girão, Teeradej Kittipassorn, Kamil Popielarz:
Generalized Majority Colourings of Digraphs. 850-855 - Jie Han, Allan Lo, Andrew Treglown, Yi Zhao:
Exact Minimum Codegree Threshold for K - 4-Factors. 856-885 - Peter Keevash, William Lochet:
The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours. 886-910 - Richard Montgomery:
Fractional Clique Decompositions of Dense Partite Graphs. 911-943 - Pavel Zorin-Kranich:
Corners Over Quasirandom Groups. 944-951
- Boris Bukh, Zilin Jiang:
Erratum For 'A Bound on the Number of Edges in Graphs Without an Even Cycle'. 952-953
- Aner Shalev:
Corrigendum to 'Mixing, Communication Complexity and Conjectures of Gowers and Viola'. 954-955
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-12-19 22:17 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:
