Journal: Combinatorica

Volume 39, Issue 6

1191 -- 1202Ron Aharoni, Ron Holzman, Zilin Jiang. Rainbow Fractional Matchings
1203 -- 1223Daniela A. Amato. Highly-Arc-Transitive and Descendant-Homogeneous Digraphs with Finite Out-Valency
1225 -- 1235Nathan J. Bowler, Johannes Carmesin, Péter Komjáth, Christian Reiher. The Colouring Number of Infinite Graphs
1237 -- 1253Zdenek Dvorák, Bojan Mohar, Robert Sámal. 6-Flows
1255 -- 1266Peter Frankl, Andrey Kupavskii. Incompatible Intersection Properties
1267 -- 1279Radoslav Fulek, Jan Kyncl. Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4
1281 -- 1315Yahya Ould Hamidoune. Hyper-Atoms Applied to the Critical Pair Theory
1317 -- 1333Attila Joó. Vertex-Flames in Countable Rooted Digraphs Preserving an Erdős-Menger Separation for Each Vertex
1335 -- 1350Daniel M. Kane, Carlo Sanna, Jeffrey Shallit. Waring's Theorem for Binary Powers
1351 -- 1386Martin Nägele, Benny Sudakov, Rico Zenklusen. Submodular Minimization Under Congruency Constraints
1387 -- 1412Sergey Norin, Alex Scott 0001, Paul D. Seymour, David R. Wood. Clustered Colouring in Minor-Closed Classes
1413 -- 1423Neil Robertson, Paul D. Seymour, Robin Thomas 0001. Girth Six Cubic Graphs Have Petersen Minors
1425 -- 1428Ferdinand Ihringer, Hajime Tanaka. k

Volume 39, Issue 5

961 -- 982Louis Bellmann, Christian Reiher. Turán's Theorem for the Fano Plane
983 -- 991Maria Chudnovsky, Jacob Fox, Alex D. Scott, Paul D. Seymour, Sophie Spirkl. Towards Erdős-Hajnal for Graphs with No 5-Hole
993 -- 1019Agelos Georgakopoulos, Matthias Hamann. The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs
1021 -- 1053Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé. Coloring Dense Digraphs
1055 -- 1079Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert. Nowhere Dense Graph Classes and Dimension
1081 -- 1104Rose McCarty, Robin Thomas 0001. The Extremal Function for Bipartite Linklessly Embeddable Graphs
1105 -- 1132Alex D. Scott, Paul D. Seymour. Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue
1133 -- 1148Uri Shapira, Reut Zuck. Asymptotic Metric Behavior of Random Cayley Graphs of Finite Abelian Groups
1149 -- 1171Adam Bene Watts, Sergey Norin, Liana Yepremyan. A Turán Theorem for Extensions Via an Erdős-Ko-Rado Theorem for Lagrangians
1173 -- 1184Jeroen Zuiddam. The Asymptotic Spectrum of Graphs and the Shannon Capacity
1185 -- 1189Shahram Mohsenipour, Saharon Shelah. On Finitary Hindman Numbers

Volume 39, Issue 4

719 -- 752Ahmad Abdi, Bertrand Guenin. The Minimally Non-Ideal Binary Clutters with a Triangle
753 -- 777Ahmad Abdi, Bertrand Guenin. The Two-Point Fano and Ideal Binary Clutters
779 -- 811Hyungryul Baik, Bram Petri, Jean Raimbault. Subgroup Growth of Virtually Cyclic Right-Angled Coxeter Groups and Their Free Products
813 -- 823Yong-Gao Chen, Jin-Hui Fang. Additive Complements with Narkiewicz's Condition
825 -- 845Carolyn Chun, James G. Oxley. Internally 4-Connected Binary Matroids with Every Element in Three Triangles
847 -- 878Louis DeBiasio, Paul McKenney. Density of Monochromatic Infinite Subgraphs
879 -- 910Reinhard Diestel, Sang-il Oum. Tangle-Tree Duality: In Graphs, Matroids and Beyond
911 -- 921Tomas Juskevicius, Grazvydas Semetulskis. Optimal Littlewood-Offord Inequalities in Groups
923 -- 932Danny Nguyen, Igor Pak. VC-Dimensions of Short Presburger Formulas
933 -- 960Mustazee Rahman, Bálint Virág, Máté Vizer. Geometry of Permutation Limits

Volume 39, Issue 3

477 -- 500Pavle V. M. Blagojevic, Albert Haase, Günter M. Ziegler. Tverberg-Type Theorems for Matroids: A Counterexample and a Proof
501 -- 544Maarten De Boeck, Geertrui Van de Voorde. Elation KM-Arcs
545 -- 596Johannes Carmesin. All Graphs Have Tree-Decompositions Displaying Their Topological Ends
597 -- 626Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran. Twenty (Short) Questions
627 -- 637Florian Frick, Shira Zerbib. Colorful Coverings of Polytopes and Piercing Numbers of Colorful d-Intervals
639 -- 658Lior Gishboliner, Asaf Shapira. Efficient Removal Without Efficient Regularity
659 -- 678Stefanie Huber, Stefan Geschke, Menachem Kojman. Partitioning Subgraphs of Profinite Ordered Graphs
679 -- 704Dhruv Mubayi, Lujia Wang. The Number of Triple Systems Without Even Cycles
705 -- 714Cosmin Pohoata, Adam Sheffer. Local Properties in Colored Graphs, Distinct Distances, and Difference Sets

Volume 39, Issue 2

239 -- 263Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé. Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture
265 -- 272Sally Dong, Jim Geelen. Improved Bounds for Rota's Basis Conjecture
273 -- 288Sean Eberhard, Stefan-Christoph Virchow. The Probability of Generating the Symmetric Group
289 -- 32Alexander L. Gavrilyuk, Jack H. Koolen. 2
323 -- 354Ashish Goel, Michael Kapralov, Sanjeev Khanna. Perfect Matchings in Õ (n 1.5) Time in Regular Bipartite Graphs
355 -- 376Choongbum Lee, Brandon Tran. The Sub-Exponential Transition for the Chromatic Generalized Ramsey Numbers
377 -- 410Patrice Ossona de Mendez, Sang-il Oum, David R. Wood. Defective Colouring of Graphs Excluding A Subgraph or Minor
411 -- 426Thang Van Pham, Le Anh Vinh, Frank de Zeeuw. Three-Variable Expanding Polynomials and Higher-Dimensional Distinct Distances
427 -- 446Naser T. Sardari. Diameter of Ramanujan Graphs and Random Cayley Graphs
447 -- 458Pablo Soberón. Tverberg Partitions as Weak Epsilon-Nets
459 -- 475Yu Yokoi. List Supermodular Coloring with Shorter Lists

Volume 39, Issue 1

1 -- 36Henning Bruhn, Matthias Heinlein, Felix Joos. Long Cycles have the Edge-Erdős-Pósa Property
37 -- 75Reinhard Diestel, Fabian Hundertmark, Sahar Lemanczyk. Profiles of Separations: in Graphs, Matroids, and Beyond
77 -- 84Jirí Fink. Matchings Extend into 2-Factors in Hypercubes
85 -- 90Ron Holzman, Nitzan Tur. Simultaneous Linear Discrepancy for Unions of Intervals
91 -- 133Tony Huynh, Felix Joos, Paul Wollan. A Unified Erdős-Pósa Theorem for Constrained Cycles
135 -- 151Michael Krivelevich. Long Cycles in Locally Expanding Graphs, with Applications
153 -- 164Andrey Kupavskii, János Pach, István Tomon. On the Size of K-Cross-Free Families
165 -- 214Chris Lambie-Hanson, Assaf Rinot. Reflection on the Coloring and Chromatic Numbers
215 -- 237Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon. Ramsey Graphs Induce Subgraphs of Many Different Sizes