Journal: Combinatorics, Probability & Computing

Volume 27, Issue 6

853 -- 891Gerandy Brito, Christopher Fowler, Matthew Junge, Avi Levy. Ewens Sampling and Invariable Generation
892 -- 912Alex Cameron, Emily Heath. A (5, 5)-Colouring of Kn with Few Colours
913 -- 945Andrew J. Goodall, Thomas Krajewski, Guus Regts, Lluís Vena. A Tutte Polynomial for Maps
946 -- 973Laurent Ménard. Volumes in the Uniform Infinite Planar Triangulation: From Skeletons to Generating Functions
974 -- 987Dhruv Mubayi, Lujia Wang. Multicolour Sunflowers
988 -- 998Thomas J. Perrett, Carsten Thomassen. Density of Chromatic Roots in Minor-Closed Graph Families

Volume 27, Issue 5

716 -- 724Ferenc Bencs. Christoffel-Darboux Type Identities for the Independence Polynomial
725 -- 740Wouter Cames van Batenburg, Ross J. Kang. Packing Graphs of Bounded Codegree
741 -- 762Oliver Cooley, Mihyun Kang, Yury Person. Largest Components in Random Hypergraphs
763 -- 773Agelos Georgakopoulos, Stephan Wagner. Subcritical Graph Classes Containing All Planar Graphs
774 -- 793Penny Haxell, Lothar Narins. A Stability Theorem for Matchings in Tripartite 3-Graphs
794 -- 807Ross J. Kang, François Pirot. Distance Colouring Without One Cycle Length
808 -- 828Leonid A. Levin, Ramarathnam Venkatesan. An Average Case NP-complete Graph Colouring Problem
829 -- 850Shiping Liu, Norbert Peyerimhoff. Eigenvalue Ratios of Non-Negatively Curved Graphs
851 -- 852Jacob Fox, László Miklós Lovász, Yufei Zhao. Erratum: On Regularity Lemmas and their Algorithmic Applications

Volume 27, Issue 4

441 -- 0Paul Balister, Béla Bollobás, Imre Leader, Robert Morris 0001. Introduction
442 -- 448Noga Alon. Uniformly Discrete Forests with Poor Visibility
449 -- 474József Balogh, Andrew McDowell, Theodore Molla, Richard Mycroft. Triangle-Tilings in Graphs Without Large Independent Sets
475 -- 495Joseph Briggs, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh. Packing Hamilton Cycles Online
496 -- 530Amin Coja-Oghlan, Nick Wormald. The Number of Satisfying Assignments of Random Regular k-SAT Formulas
531 -- 538Dwight Duffus, Bill Kay, Vojtech Rödl. The Minimum Number of Edges in Uniform Hypergraphs with Property O
539 -- 579Jacob Fox, Fan Wei. Fast Property Testing and Metrics for Permutations
580 -- 622Vytautas Gruslys, Shoham Letzter. Minimizing the Number of Triangular Edges
623 -- 642Nina Kamcev, Tomasz Luczak, Benny Sudakov. Anagram-Free Colourings of Graphs
643 -- 666Johannes Lengler, Angelika Steger. Drift Analysis and Evolutionary Algorithms Revisited
667 -- 671Bhargav Narayanan. Connections in Randomly Oriented Graphs
672 -- 715Dudley Stark, Nick Wormald. The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph

Volume 27, Issue 3

289 -- 309Igor Balla, Alexey Pokrovskiy, Benny Sudakov. Ramsey Goodness of Bounded Degree Trees
310 -- 333Anurag Bishnoi, Pete L. Clark, Aditya Potukuchi, John R. Schmitt. On Zeros of a Polynomial in a Finite Grid
334 -- 357Raphaël Bouyrie. On Quantitative Noise Stability and Influences for Discrete and Continuous Models
358 -- 386Clayton Collier-Cartaino, Nathan Graber, Tao Jiang. Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
387 -- 397Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey. A Sharp Dirac-Erdős Type Bound for Large Graphs
398 -- 410Seongmin Ok, Thomas J. Perrett. Density of Real Zeros of the Tutte Polynomial
411 -- 426Shravas Rao, Igor Shinkar. On Lipschitz Bijections Between Boolean Functions
427 -- 440Pablo Soberón. Robust Tverberg and Colourful Carathéodory Results via Random Choice

Volume 27, Issue 2

141 -- 161Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Barnaby Roberts. Triangle-Free Subgraphs of Random Graphs
162 -- 185Van Hao Can. Super-Exponential Extinction Time of the Contact Process on Random Geometric Graphs
186 -- 207Péter L. Erdös, István Miklós, Zoltán Toroczkai. New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling
208 -- 227Ohad N. Feldheim, Yinon Spinka. The Growth Constant of Odd Cutsets in High Dimensions
228 -- 244Alan M. Frieze, Tony Johansson. On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
245 -- 273Andrey Kupavskii, Dmitry A. Shabanov. Colourings of Uniform Hypergraphs with Large Girth and Applications
274 -- 288Po-Shen Loh, Michael Tait, Craig Timmons, Rodrigo M. Zhou. Induced Turán Numbers

Volume 27, Issue 1

1 -- 20Agnes Backhausz, Balázs Gerencsér, Viktor Harangi, Máté Vizer. Correlation Bounds for Distant Parts of Factor of IID Processes
21 -- 43Henning Bruhn, Felix Joos. A Stronger Bound for the Strong Chromatic Index
44 -- 59Genghua Fan, Jianfeng Hou, Xingxing Yu. Bisections of Graphs Without Short Cycles
60 -- 68Peter Frankl, Andrey Kupavskii. Counting Intersecting and Pairs of Cross-Intersecting Families
69 -- 83Nathan Linial, Michael Simkin. Monotone Subsequences in High-Dimensional Permutations
84 -- 109Aaron M. Montgomery. Asymptotic Enumeration of Difference Matrices over Cyclic Groups
110 -- 123Bhargav P. Narayanan, István Tomon. Induced Subgraphs With Many Distinct Degrees
124 -- 140Van Vu. A Simple SVD Algorithm for Finding Hidden Partitions