Journal: Combinatorics, Probability & Computing

Volume 29, Issue 6

807 -- 829Gabriel Conant. On finite sets of small tripling or small alternation in arbitrary groups
830 -- 867Shagnik Das, Andrew Treglown. Ramsey properties of randomly perturbed graphs: cliques and cycles
868 -- 885Stefan Ehard, Stefan Glock, Felix Joos. Pseudorandom hypergraph matchings
886 -- 899Anita Liebenau, Yanitsa Pehova. An approximate version of Jackson's conjecture
900 -- 942Richard Montgomery 0001. Hamiltonicity in random directed graphs is born resilient
943 -- 955Frank Mousset, Rajko Nenadov, Wojciech Samotij. Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties
956 -- 960Asaf Ferber, Asaf Shapira. A quantitative Lovász criterion for Property B

Volume 29, Issue 5

641 -- 649Heiner Oberkampf, Mathias Schacht. On the structure of Dense graphs with bounded clique number
650 -- 663Orit E. Raz. A note on distinct distances
664 -- 671Michael Haythorpe, Alex Newcombe. Constructing families of cospectral regular graphs
672 -- 697Sam Greenberg, Dana Randall, Amanda Pascoe Streib. Sampling biased monotonic surfaces using exponential metrics
698 -- 721Tao Jiang, Liana Yepremyan. Supersaturation of even linear cycles in linear hypergraphs
722 -- 746Emma Yu Jin, Benedikt Stufler. Graph limits of random unlabelled k-trees
747 -- 756Dániel Korándi, István Tomon. Improved Ramsey-type results for comparability graphs
757 -- 779Patrick Bennett, Andrzej Dudek, Shira Zerbib. Large triangle packings and Tuza's conjecture in sparse random graphs
780 -- 806Alessandra Graf, Penny Haxell. Finding independent transversals efficiently

Volume 29, Issue 4

485 -- 494Amir Yehudayoff. Pointer chasing via triangular discrimination
495 -- 507Boris Bukh, Michael Tait. Turán numbers of theta graphs
508 -- 536Michael C. H. Choi, Pierre Patie. Analysis of non-reversible Markov chains via similarity orbits
537 -- 554Dennis Clemens, Anita Liebenau, Damian Reding. On minimal Ramsey graphs and Ramsey equivalence in multiple colours
555 -- 586Charilaos Efthymiou. Deterministic counting of graph colourings using sequences of subgraphs
587 -- 615Agelos Georgakopoulos, John Haslegrave. Percolation on an infinitely generated group
616 -- 632Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni. Estimating parameters associated with monotone properties
633 -- 640Jason Long. A note on the Brown-Erdős-Sós conjecture in groups

Volume 29, Issue 3

318 -- 345Matija Bucic, Sven Heberle, Shoham Letzter, Benny Sudakov. Monochromatic trees in random tournaments
346 -- 422Amin Coja-Oghlan, Tobias Kapetanopoulos, Noëla Müller. The replica symmetric phase of random constraint satisfaction problems
423 -- 435Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Oscar Zamora. Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2
436 -- 454Dániel Grósz, Abhishek Methuku, Casey Tompkins. On subgraphs of C2k-free graphs and a problem of Kühn and Osthus
455 -- 484James B. Martin, Roman Stasinski. Minimax functions on Galton-Watson trees

Volume 29, Issue 2

163 -- 189Noga Alon, Dan Hefetz, Michael Krivelevich, Mykhaylo Tyomkyn. Edge-statistics on large graphs
190 -- 199Omer Angel, Abbas Mehrabian, Yuval Peres. The string of diamonds is nearly tight for rumour spreading
200 -- 212Yuval Filmus. FKN theorem for the multislice, with applications
213 -- 233Annika Heckel. Sharp concentration of the equitable chromatic number of dense random graphs
234 -- 240Peter Keevash, Liana Yepremyan. On the number of symbols that forces a transversal
241 -- 266Mickaël Maazoun. On the Brownian separable permuton
267 -- 292Hoi. H. Nguyen, Elliot Paquette. Surjectivity of near-square random matrices
293 -- 309Benedikt Stufler. Unlabelled Gibbs partitions
310 -- 317Joshua Zahl. Counting higher order tangencies for plane curves

Volume 29, Issue 1

1 -- 21Meysam Alishahi, Hossein Hajiabolhassan. On the Chromatic Number of Matching Kneser Graphs
22 -- 30Omer Angel, Asaf Ferber, Benny Sudakov, Vincent Tassion. Long Monotone Trails in Random Edge-Labellings of Random Graphs
31 -- 43Simeon Ball, Bence Csajbók. On sets of points with few odd secants
44 -- 67Patrick Bennett, Andrzej Dudek, Bernard Lidický, Oleg Pikhurko. Minimizing the number of 5-cycles in graphs with given edge-density
68 -- 100Lorenzo Federico, Remco van der Hofstad, Frank Den Hollander, Tim Hulshof. Expansion of Percolation Critical Points for Hamming Graphs
101 -- 112Jacob Fox, Ray Li. On Ramsey numbers of hedgehogs
113 -- 127Rajko Nenadov, Nemanja Skoric. On Komlós' tiling theorem in random graphs
128 -- 136Bo Ning 0001, Xing Peng. Extensions of the Erdős-Gallai theorem and Luo's theorem
137 -- 152Ross G. Pinsky. The Infinite limit of random permutations avoiding patterns of length three
153 -- 162Shachar Sapir, Asaf Shapira. The Induced Removal Lemma in Sparse Graphs