Journal: Combinatorics, Probability & Computing

Volume 21, Issue 6

803 -- 815Louigi Addario-Berry, Colin McDiarmid, Bruce A. Reed. Connectivity for Bridge-Addable Monotone Graph Classes
816 -- 834Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller. Cops and Robbers on Geometric Graphs
835 -- 855Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira. Testing Odd-Cycle-Freeness in Boolean Functions
856 -- 881Nicolas Broutin, Omar Fawzi. Longest Path Distance in Random Circuits
882 -- 896Siu On Chan, Michael Molloy. k-Factors
897 -- 915Dennis Clemens, Asaf Ferber, Michael Krivelevich, Anita Liebenau. Fast Strategies In Maker-Breaker Games Played on Random Boards
916 -- 941Chaim Even-Zohar. n
942 -- 951Ben Green. On (Not) Computing the Möbius Function Using Bounded Depth Circuits
952 -- 962Raphael Yuster. Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing

Volume 21, Issue 5

643 -- 660Yonatan Bilu, Nathan Linial. Are Stable Instances Easy?
661 -- 682Julia Böttcher, Anusch Taraz, Andreas Würfl. Perfect Graphs of Fixed Density: Counting and Homogeneous Sets
683 -- 694Nicolas Curien. Strong Convergence of Partial Match Queries in Random Quadtrees
695 -- 714Qi Ge, Daniel Stefankovic. A Graph Polynomial for Independent Sets of Bipartite Graphs
715 -- 733Alexander Gnedin, Alexander Iksanov, Alexander Marynych. A Generalization of the Erdős-Turán Law for the Order of Random Permutation
734 -- 742Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov. Non-Three-Colourable Common Graphs Exist
743 -- 772Tomer Kotek. Complexity of Ising Polynomials
773 -- 801Choongbum Lee, Benny Sudakov, Dan Vilenchik. Getting a Directed Hamilton Cycle Two Times Faster

Volume 21, Issue 4

483 -- 495M. Amin Bahmanian. Detachments of Hypergraphs I: The Berge-Johnson Problem
496 -- 511Edward Boehnlein, Tao Jiang. Set Families With a Forbidden Induced Subposet
512 -- 514Nicolas Bousquet, Stéphan Thomassé. Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs
515 -- 530Ernie Croot. Some Properties of Lower Level-Sets of Convolutions
531 -- 553Péter Csikvári, Zoltán Lóránt Nagy. The Density Turán Problem
554 -- 581Domingos Dellamonica Jr., Vojtech Rödl. Distance Preserving Ramsey Graphs
582 -- 596Benjamin Girard, Simon Griffiths, Yahya Ould Hamidoune. k-Sums in Abelian Groups
597 -- 610Haim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir. Unit Distances in Three Dimensions
611 -- 622Alexandr V. Kostochka, Mohit Kumbhat, Tomasz Luczak. Conflict-Free Colourings of Uniform Hypergraphs With Few Edges
623 -- 634Assaf Naor. On the Banach-Space-Valued Azuma Inequality and Small-Set Isoperimetry of Alon-Roichman Graphs
635 -- 641Ádám Timár. Approximating Cayley Diagrams Versus Cayley Graphs

Volume 21, Issue 3

323 -- 329Simeon Ball, Valentina Pepe. Asymptotic Improvements to the Lower Bound of Certain Bipartite Turán Numbers
330 -- 357Graham Brightwell, Malwina Luczak. Order-Invariant Measures on Fixed Causal Sets
358 -- 373Boris Bukh, Alfredo Hubard. Space Crossing Numbers
374 -- 411Pandelis Dodos, Vassilis Kanellopoulos, Konstantinos Tyros. Measurable Events Indexed by Trees
412 -- 441Michael Fuchs 0001. Limit Theorems for Subtree Size Profiles of Increasing Trees
442 -- 450Hao Huang, Po-Shen Loh, Benny Sudakov. The Size of a Hypergraph and its Matching Number
451 -- 456Peter Keevash, Dhruv Mubayi. 3, 3
457 -- 482Allan Lo. Cliques in Graphs With Bounded Minimum Degree

Volume 21, Issue 1-2

1 -- 9Ralph J. Faudree. My Friend and Colleague, Richard Schelp
11 -- 22Paul Balister, Béla Bollobás. Critical Probabilities of 1-Independent Percolation Models
23 -- 55József Balogh, Choongbum Lee, Wojciech Samotij. Corrádi and Hajnal's Theorem for Sparse Random Graphs
57 -- 87Fabricio Siqueira Benevides, Tomasz Luczak, A. Scott, Jozef Skokan, M. White. Monochromatic Cycles in 2-Coloured Graphs
89 -- 105Béla Bollobás, Vladimir Nikiforov. Degree Powers in Graphs: The Erdős-Stone Theorem
107 -- 111Guantao Chen, Han Ren, Songling Shan. Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs
113 -- 127Domingos Dellamonica Jr., Penny E. Haxell, Tomasz Luczak, Dhruv Mubayi, Brendan Nagle, Yury Person, Vojtech Rödl, Mathias Schacht, Jacques Verstraëte. On Even-Degree Subgraphs of Linear Hypergraphs
129 -- 139Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson. Minimum Degree and Disjoint Cycles in Claw-Free Graphs
141 -- 148Peter Frankl, Vojtech Rödl, Andrzej Rucinski 0001. On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
149 -- 158Jun Fujisawa, Akira Saito. A Pair of Forbidden Subgraphs and 2-Factors
159 -- 177Zoltán Füredi. 2-Cancellative Hypergraphs and Codes
179 -- 186András Gyárfás, Gábor N. Sárközy. Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
187 -- 191Ervin Györi, Hao Li. k+1-Free Graphs
193 -- 201Ervin Györi, Nathan Lemons. Hypergraphs with No Cycle of a Given Length
203 -- 218Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann. Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size
219 -- 227Gyula O. H. Katona, Gyula Y. Katona, Zsolt Katona. Most Probably Intersecting Families of Subsets
229 -- 253William B. Kinnersley, Kevin G. Milans, Douglas B. West. Degree Ramsey Numbers of Graphs
255 -- 263Alexandr V. Kostochka, Matthew Yancey. Large Rainbow Matchings in Edge-Coloured Graphs
265 -- 299Oliver Riordan. The Phase Transition in the Configuration Model
301 -- 313Paul A. Russell. Compressions and Probably Intersecting Families
315 -- 322David Saxton, Andrew Thomason. List Colourings of Regular Hypergraphs