Journal: Combinatorica

Volume 42, Issue Supplement 2

1231 -- 1252Zach Hunter. Improved Lower Bounds for Van Der Waerden Numbers
1253 -- 1282Yoichi Iwata, Yutaro Yamaguchi 0001. Finding a Shortest Non-Zero Path in Group-Labeled Graphs
1283 -- 1316Támás Kalmán, Seunghun Lee, Lilla Tóthmérész. The Sandpile Group of a Trinity and a Canonical Definition for the Planar Bernardi Action
1317 -- 1345Vojtech Kaluza, Martin Tancer. Even Maps, the Colin de Verdière Number and Representations of Graphs
1347 -- 1356Hemanshu Kaul, Benjamin Reiniger. A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt
1357 -- 1384Hong Liu, Péter Pál Pach, Csaba Sándor. Polynomial Schur's Theorem
1385 -- 1408Matei Mandache. Finding Certain Arithmetic Progressions in 2-Coloured Cyclic Groups
1409 -- 1438Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge. Packing Directed Cycles Quarter- and Half-Integrally
1439 -- 1450Andrew Newman. A Lower Bound on the Number of Homotopy Types of Simplicial Complexes on N Vertices
1451 -- 1480Kenta Ozeki. Kempe Equivalence Classes of Cubic Graphs Embedded on the Projective Plane
1481 -- 1486Hector Pasten. On the Chevalley-Warning Theorem When the Degree Equals the Number of Variables
1487 -- 1512Jakub Przybylo. The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree
1513 -- 1525Chao Shi, Peter Frankl, Jianguo Qian. On Non-Empty Cross-Intersecting Families

Volume 42, Issue 6

771 -- 819Stefan Ehard, Felix Joos. A Short Proof of the Blow-Up Lemma for Approximate Decompositions
821 -- 852Gábor Elek, Gábor Tardos. Convergence and Limits of Finite Trees
853 -- 880Jeff Kahn 0001, Jinyoung Park. The Number of Maximal Independent Sets in the Hamming Cube
881 -- 894Hadi Kharaghani, Thomas Pender, Sho Suda. A Family of Balanced Generalized Weighing Matrices
895 -- 911Abhishek Methuku, István Tomon. Bipartite Turán Problems for Ordered Graphs
913 -- 951Ron Aharoni, Eli Berger, Joseph Briggs, Erel Segal-haLevi, Shira Zerbib. Fractionally Balanced Hypergraphs and Rainbow KKM Theorems
953 -- 969Daniele Bartoli, Nicola Durante. On the Classification of Low-Degree Ovoids of Q(4,q)
971 -- 996Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang. Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II
997 -- 1010Manuel Bodirsky, Florian Starke. Maximal Digraphs with Respect to Primitive Positive Constructability
1011 -- 1026Swee Hong Chan, Igor Pak, Greta Panova. Log-Concavity in Planar Random Walks
1027 -- 1048Gábor Damásdi, Dömötör Pálvölgyi. Realizing an m-Uniform Four-Chromatic Hypergraph with Disks
1049 -- 1079James Davies. Vertex-Minor-Closed Classes are χ-Bounded
1081 -- 1098Zdenek Dvorák, Luke Postle. On Decidability of Hyperbolicity
1099 -- 1118Ronen Eldan. Second-Order Bounds on Correlations Between Increasing Families
1119 -- 1143Nóra Frankl, Andrey Kupavskii. Almost Sharp Bounds on the Number of Discrete Chains in the Plane
1145 -- 1187Lior Gishboliner, Raphael Steiner, Tibor Szabó. Oriented Cycles in Digraphs of Large Outdegree
1189 -- 1229Rani Hod, Michael Krivelevich, Tobias Müller 0001, Alon Naor, Nicholas C. Wormald. Component Games on Random Graphs

Volume 42, Issue 5

617 -- 658Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill. Lower Bounds on the Chromatic Number of Random Graphs
659 -- 672Martin Balko, David Chodounský, Jan Hubicka, Matej Konecný, Lluís Vena. Big Ramsey Degrees of 3-Uniform Hypergraphs Are Finite
673 -- 700Daniele Bartoli, Giacomo Micheli. Algebraic Constructions of Complete m-Arcs
701 -- 728Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera. Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12
729 -- 747Tsz Ho Chan, Jared D. Lichtman, Carl Pomerance. On the Critical Exponent for k-Primitive Sets
749 -- 762Bodo Lass. Calculating the Euler Characteristic of the Moduli Space of Curves
763 -- 769Max Pitz. Constructing Tree-Decompositions That Display All Topological Ends

Volume 42, Issue 4

463 -- 490Jana Cslovjecsek, Romanos-Diogenes Malikiosis, Márton Naszódi, Matthias Schymura. Computing the Covering Radius of a Polytope with an Application to Lonely Runners
491 -- 527Sean Eberhard. The Characteristic Polynomial of a Random Matrix
529 -- 551Maxime Bourque-Fortin, Bram Petri. Kissing Numbers of Regular Graphs
553 -- 558Gábor Kun. On Gardner's Conjecture
559 -- 586Zhicong Lin, Dongsu Kim. A Combinatorial Bijection on k-Noncrossing Partitions
587 -- 616Pavel Pudlák, Vojtech Rödl. Extractors for Small Zero-Fixing Sources

Volume 42, Issue 3

309 -- 363David Conlon, Jacob Fox, Yuval Wigderson. Ramsey Numbers of Books and Quasirandomness
365 -- 404Jan Grebík, Israel Rocha. Fractional Isomorphism of Graphons
405 -- 432Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan. Excluding a Ladder
433 -- 462Xizhi Liu, Dhruv Mubayi. A Hypergraph Turán Problem with No Stability

Volume 42, Issue 2

151 -- 164Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood. Stack-Number is Not Bounded by Queue-Number
165 -- 202François Hennecart, Gyan Prakash, Pramod Eyyunni. On Thin Sum-Product Bases
203 -- 236Dávid Matolcsi, Imre Z. Ruzsa, George Shakan, Dmitrii Zhelezov. An Analytic Approach to Cardinalities of Sumsets
237 -- 251Arnold Neumaier, Safet Penjic. On Bounding the Diameter of a Distance-Regular Graph
253 -- 300Luke Postle, Evelyne Smith-Roberge. 7-Critical Graphs
301 -- 308Claude Tardif. The Chromatic Number of the Product of 14-Chromatic Graphs Can BE 13

Volume 42, Issue 1

1 -- 8Karim Adiprasito, Sergey Avvakumov, Roman N. Karasev. n
9 -- 69Dana Bartosová, Jordi Lopez-Abad, Martino Lupini, Brice Mbombo. The Ramsey Properties for Grassmannians Over ℝ, ℂ
71 -- 85Brandon Hanson, Oliver Roche-Newton, Misha Rudnev. Higher Convexity and Iterated Sum Sets
87 -- 114Daniel Král', Jonathan A. Noel, Sergey Norin, Jan Volec, Fan Wei. Non-Bipartite K-Common Graphs
115 -- 136Tomasz Luczak 0001, Joanna Polcyn, Christian Reiher. On the Ramsey-Turán Density of Triangles
137 -- 149Sergey Norin, Zi-Xia Song. t Minor