Journal: Combinatorics, Probability & Computing

Volume 30, Issue 6

811 -- 848Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick. Optimal group testing
849 -- 893Svante Janson. Tree limits and limits of random trees
894 -- 898Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov. Powers of paths in tournaments
899 -- 904Sean Eberhard, Jeff Kahn, Bhargav Narayanan, Sophie Spirkl. On symmetric intersecting families of vectors
905 -- 921Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller. Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
922 -- 929Ben Green 0001, Aled Walker. Extremal problems for GCDs
930 -- 941Bodan Arsovski. Additive bases via Fourier analysis
942 -- 955Matija Bucic, Nemanja Draganic, Benny Sudakov. Universal and unavoidable graphs
956 -- 981Leonid Gurvits, Jonathan Leake. Counting matchings via capacity-preserving operators
982 -- 987István Tomon, Dmitriy Zakharov. Turán-type results for intersection graphs of boxes

Volume 30, Issue 5

654 -- 669G. R. Omidi. A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles
670 -- 685Dennis Clemens, Meysam Miralaei, Damian Reding, Mathias Schacht, Anusch Taraz. On the size-Ramsey number of grid graphs
686 -- 721W. T. Gowers 0001, J. Long. The length of an s-increasing sequence of r-tuples
722 -- 740Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht. Ramsey-type numbers involving graphs and hypergraphs with large girth
741 -- 761Guido Besomi, Matías Pavez-Signé, Maya Stein. On the Erdős-Sós conjecture for trees with bounded degree
762 -- 780Pu Gao, Reshma Ramadurai, Ian M. Wanless, Nick Wormald. Full rainbow matchings in graphs and hypergraphs
781 -- 795Hong Liu, Péter Pál Pach, Richárd Palincza. The number of maximum primitive sets of integers
796 -- 799Ashwin Sah, Mehtaab Sawhney, Jonathan Tidor, Yufei Zhao. A counterexample to the Bollobás-Riordan conjectures on sparse graph limits
800 -- 810Hüseyin Acan, Charles F. Burnette, Sean Eberhard, Eric Schmutz, James Thomas. Permutations with equal orders

Volume 30, Issue 4

498 -- 512János Pach, Gábor Tardos, Géza Tóth 0001. Disjointness graphs of segments in the space
513 -- 525Tom Johnston, Alex D. Scott. Lipschitz bijections between boolean functions
526 -- 549Vytautas Gruslys, Shoham Letzter. Cycle partitions of regular graphs
550 -- 569Per Kristian Lehre, Carsten Witt. Tail bounds on hitting times of randomized search heuristics using variable drift analysis
570 -- 590Jie Han 0002, Yoshiharu Kohayakawa, Yury Person. Near-perfect clique-factors in sparse pseudorandom graphs
591 -- 608W. T. Gowers 0001, Barnabás Janzer. Generalizations of the Ruzsa-Szemerédi and rainbow Turán problems for cliques
609 -- 618József Balogh, Felix Christian Clemen, Mikhail Lavrov, Bernard Lidický, Florian Pfender. Making Kr+1-free graphs r-partite
619 -- 630Joshua Erde, Mihyun Kang, Michael Krivelevich. Large complete minors in random subgraphs
631 -- 653Stefan Glock, Stephen Gould, Felix Joos, Daniela Kühn, Deryk Osthus. Counting Hamilton cycles in Dirac hypergraphs

Volume 30, Issue 3

330 -- 343Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau. Frozen (Δ + 1)-colourings of bounded degree graphs
344 -- 359Ararat Harutyunyan, Paul Horn, Jacques Verstraëte. Independent dominating sets in graphs of girth five
360 -- 373Noga Alon, Raimundo Briceño, Nishant Chandgotia, Alexander Magazinov, Yinon Spinka. Mixing properties of colourings of the ℤd lattice
374 -- 397Joel Larsson. The minimum perfect matching in pseudo-dimension 0 < q < 1
398 -- 411Cole Franks. A simplified disproof of Beck's three permutations conjecture and an application to root-mean-squared discrepancy
412 -- 443Elad Aigner-Horev, Gil Levy. Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
444 -- 459József Balogh, Béla Csaba, András Pluhár, Andrew Treglown. A discrepancy version of the Hajnal-Szemerédi theorem
460 -- 497Catherine S. Greenhill, Mikhail Isaev, Brendan D. McKay. Subgraph counts for dense random graphs with specified degrees

Volume 30, Issue 2

163 -- 174Asaf Ferber, Kyle Luh, Gweneth McKinley. Resilience of the rank of random matrices
175 -- 199Asaf Ferber, Kyle Luh, Gweneth McKinley. Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
200 -- 227A. Nicholas Day, Victor Falgas-Ravry. Maker-Breaker percolation games I: crossing grids
228 -- 238Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht. Hamiltonian Berge cycles in random hypergraphs
239 -- 257Deepak Bal, Ross Berkowitz, Pat Devlin, Mathias Schacht. Finding tight Hamilton cycles in random hypergraphs faster
258 -- 270Huiqiu Lin, Bo Ning 0001, Baoyindureng Wu. Eigenvalues and triangles in graphs
271 -- 287Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec. Sharp bounds for decomposing graphs into edges and triangles
288 -- 329Jie Han 0002, Allan Lo, Nicolás Sanhueza-Matamala. Covering and tiling hypergraphs with tight cycles

Volume 30, Issue 1

1 -- 16Ryan Alweiss, Chady Ben Hamida, Xiaoyu He, Alexander Moreira. On the subgraph query problem
17 -- 36Padraig Condon, Alberto Espuny Díaz, António Girão, Daniela Kühn, Deryk Osthus. Dirac's theorem for random regular graphs
37 -- 78Rami Daknama, Konstantinos Panagiotou, Simon Reisser. Robustness of randomized rumour spreading
79 -- 104Laura Eslava. A non-increasing tree growth process for recursive trees and applications
105 -- 123James Allen Fill. Breaking bivariate records
124 -- 135Heng Guo 0001, Mark Jerrum. Approximately counting bases of bicircular matroids
136 -- 152Richard Lang, Allan Lo. Monochromatic cycle partitions in random graphs
153 -- 162Mykhaylo Tyomkyn. Many disjoint triangles in co-triangle-free graphs