COMBINATORICA is an international journal of

**the Bolyai Mathematical Society, Hungary**,

published jointly by

the Bolyai Mathematical Society and Springer.

COMBINATORICA publishes research papers in a variety of areas of *combinatorics and the theory of computing*, with particular emphasis on *general techniques and unifying principles*.

Coverage in COMBINATORICA includes:

- combinatorial structures (graphs, matroids, hypergraphs, designs, permutation groups);
- combinatorial optimization;
- combinatorial aspects of geometry and number theory;
- algorithms in combinatorics and related fields;
- computational complexity theory;
- randomization and explicit construction in combinatorics and algorithms.

Six issues appear each year. A total of 30-40 papers are accepted for publication out of roughly 300 submissions per year.

**Imre Bárány**, Rényi Institute of Mathematics, Budapest

**József Solymosi**, University of British Columbia

**László Babai**, University of Chicago

**László Lovász**, ELTE Eötvös University, Budapest

**Lilla Tóthmérész**, ELTE Eötvös University, Budapest

**Viktor Harangi**, Rényi Institute of Mathematics, Budapest

**Gyula O.H. Katona**, Rényi Institute of Mathematics, Budapest

**Miklós Simonovits**, Rényi Institute of Mathematics, Budapest

** Vera T. Sós ** 1930—2023

**Endre Szemerédi**, Rényi Institute of Mathematics, Budapest

**Miklós Abért**, Rényi Institute of Mathematics, Budapest

**Noga Alon**, Tel Aviv University & Princeton University

**József Balogh**, University of Illinois

**Anders Björner**, Royal Institute of Technology (KTH), Stockholm

**Béla Bollobás**, University of Cambridge & The University of Memphis

**Maria Chudnovsky**, Princeton University

**András Frank**, ELTE Eötvös University, Budapest

**Peter Frankl**, Rényi Institute of Mathematics, Budapest

**Zoltán Füredi**, Rényi Institute of Mathematics, Budapest

**Péter Komjáth**, ELTE Eötvös University, Budapest

**Nathan Linial**, The Hebrew University of Jerusalem

**Jaroslav Nešetřil**, Charles University, Prague

**János Pach**, Rényi Institute of Mathematics, Budapest & EPFL, Lausanne

**Alexander A. Razborov**, University of Chicago & Steklov Math. Inst., Moscow

**Vojtěch Rödl**, Emory University, Atlanta

**Imre Z. Ruzsa**, Rényi Institute of Mathematics, Budapest

**Lisa Sauermann**, MIT

**Alexander Schrijver**, CWI Amsterdam & University of Amsterdam

**Alexander Scott**, University of Oxford

**Paul D. Seymour**, Princeton University

**Benny Sudakov**, ETH, Zürich

**Gábor Tardos**, Rényi Institute of Mathematics, Budapest

**Van H. Vu**, Yale University

**Avi Wigderson**, Institute for Advanced Study, Princeton

Papers can be submitted to COMBINATORICA
via EditFlow.

Please **read the instructions below** before submission.

*Submission.*Manuscripts should be submitted via the editorial system EditFlow. Please use the following link: https://ef.msp.org/submit/combinatorica*Length.*The length of the paper should not exceed 30 pages (in 11-point LaTeX format on US letter-size paper with 1-inch margins). Authors of longer papers are advised to submit a 30-page version to COMBINATORICA with a link to a full version on arXiv.*Notes.*Short notes are welcome and processed in an expedited fashion.*Form of the manuscript.*The manuscript should contain a brief abstract. In a paper divided into sections, it is desirable to number theorems, lemmas, definitions, corollaries, examples, etc. consecutively using double Arabic numerals. (E.g., Section 3 may start with Definition 3.1 followed by Remark 3.2 and Theorem 3.3).*Style.*Clarity of the presentation is paramount. The results should be made accessible to the non-specialist reader. Authors should give clear motivation, background, and exact references.*Final version.*If the paper is accepted, the following should be submitted.- The final version of the paper in TeX/LaTeX format. It is best to avoid using complicated macros or non-standard packages and fonts as they tend to be in conflict with the journal format. Furthermore, it significantly simplifies the typesetting process if unused packages and definitions are deleted by the author. In general, a plain "vanilla" version is the least prone to errors when adapting it to the journal format.
- Each figure in a separate file (in a vector graphic format that can handle embedded fonts such as EPS or vector PDF). Note that while the online version is published in color, the print version is converted to grayscale. Ensure that the figure can still be understood even when it is printed in grayscale. For example, avoid referring to colors in the text.
- Affiliation and e-mail address for each author.
- Abbreviated title (at most 35 characters), to be used as the running head.
- Mathematics Subject Classification codes (primary and secondary).

*Reprints.*50 Reprints are provided free of charge upon request. Additional reprints may be ordered.

Papers waiting to be assigned to an issue: Online First articles.

Marcin Briański, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michał T. Seweryn, Roohani Sharma

Treedepth vs Circumference

Pages 659-664 | DOI:10.1007/s00493-023-00028-5

Asaf Ferber, Liam Hardiman, Adva Mond

Counting Hamilton Cycles in Dirac Hypergraphs

Pages 665-680 | DOI:10.1007/s00493-023-00029-4

G. Longobardi, Giuseppe Marino, Rocco Trombetti, Yue Zhou

A Large Family of Maximum Scattered Linear Sets of PG(1,qn) and Their Associated MRD Codes

Pages 681-716 | DOI:10.1007/s00493-023-00030-x

S. Avvakumov, R. Karasev, A. Skopenkov

Stronger Counterexamples to the Topological Tverberg Conjecture

Pages 717-727 | DOI:10.1007/s00493-023-00031-w

Eric Naslund

Upper Bounds For Families Without Weak Delta-Systems

Pages 729-735 | DOI:10.1007/s00493-023-00032-9

Rajko Nenadov

Routing Permutations on Spectral Expanders via Matchings

Pages 737-742 | DOI:10.1007/s00493-023-00033-8

David Conlon, Jacob Fox, Yuval Wigderson

Three Early Problems on Size Ramsey Numbers

Pages 743-768 | DOI:10.1007/s00493-023-00034-7

Peter J. Bradshaw

Growth in Sumsets of Higher Convex Functions

Pages 769-789 | DOI:10.1007/s00493-023-00035-6

Jakub Przybyło, Fan Wei

On the Asymptotic Confirmation of the Faudree–Lehel Conjecture for General Graphs

Pages 791-826 | DOI:10.1007/s00493-023-00036-5

Brett Kolesnik

The Asymptotic Number of Score Sequences

Pages 827-844 | DOI:10.1007/s00493-023-00037-4

Domagoj Bradač, Lior Gishboliner, Oliver Janzer, Benny Sudakov

Asymptotics of the Hypergraph Bipartite Turán Problem

Pages 429-446 | DOI:10.1007/s00493-023-00019-6

Jun Gao, Jie Ma

Tight Bounds Towards a Conjecture of Gallai

Pages 447-453 | DOI:10.1007/s00493-023-00020-z

Karthekeyan Chandrasekaran, Chandra Chekuri

Min–Max Partitioning of Hypergraphs and Symmetric Submodular Functions

Pages 455-477 | DOI:10.1007/s00493-023-00021-y

Matias von Bell, Rafael S. González D’León, Francisco A. Mayorga Cetina, Martha Yip

A Unifying Framework for the ν-Tamari Lattice and Principal Order Ideals in Young’s Lattice

Pages 479-504 | DOI:10.1007/s00493-023-00022-x

Matija Bucić, Benny Sudakov

Large Independent Sets from Local Considerations

Pages 505-546 | DOI:10.1007/s00493-023-00023-w

Richard Lang, Luke Postle

An Improved Bound for the Linear Arboricity Conjecture

Pages 547-569 | DOI:10.1007/s00493-023-00024-9

Alex Scott, Paul Seymour, Sophie Spirkl

Pure Pairs. V. Excluding Some Long Subdivision

Pages 571-593 | DOI:10.1007/s00493-023-00025-8

Md Lutfar Rahman, Thomas Watson

6-Uniform Maker-Breaker Game is PSPACE-Complete

Pages 595-612 | DOI:10.1007/s00493-023-00026-7

Ron Rosenthal, Lior Tenenbaum

Simplicial Spanning Trees in Random Steiner Complexes

Pages 613-650 | DOI:10.1007/s00493-023-00038-3

Ralph Keusch

Vertex-Coloring Graphs with 4-Edge-Weightings

Pages 651-658 | DOI:10.1007/s00493-023-00027-6

Zilin Jiang, Jonathan Tidor, Yuan Yao, Shengtong Zhang, Yufei Zhao

Spherical Two-Distance Sets and Eigenvalues of Signed Graphs

Pages 203-232 | DOI:10.1007/s00493-023-00002-1

Sean Eberhard

Hamming Sandwiches

Pages 233-256 | DOI:10.1007/s00493-023-00004-z

A. E. Brouwer, F. Ihringer, W. M. Kantor

Strongly Regular Graphs Satisfying the 4-Vertex Condition

Pages 257-276 | DOI:10.1007/s00493-023-00005-y

Lukas Kühne

The Universality of the Resonance Arrangement and Its Betti Numbers

Pages 277-298 | DOI:10.1007/s00493-023-00006-x

Daniel Glasscock, Joel Moreira, Florian K. Richter

A combinatorial proof of a sumset conjecture of Furstenberg

Pages 299-328 | DOI:10.1007/s00493-023-00008-9

I. D. Shkredov

On an Application of Higher Energies to Sidon Sets

Pages 329-345 | DOI:10.1007/s00493-023-00013-y

Chaoping Xing, Chen Yuan

Beating the Probabilistic Lower Bound on q-Perfect Hashing

Pages 347-366 | DOI:10.1007/s00493-023-00014-x

Evita Nestoridi, Peter Sarnak

Bounded Cutoff Window for the Non-backtracking Random Walk on Ramanujan Graphs

Pages 367-384 | DOI:10.1007/s00493-023-00017-8

Isabel Hubard, Elías Mochán, Antonio Montero

Voltage Operations on Maniplexes, Polytopes and Maps

Pages 385-420 | DOI:10.1007/s00493-023-00018-7

Ádám Timár

A Factor Matching of Optimal Tail Between Poisson Processes

Pages 421-427 | DOI:10.1007/s00493-023-00051-6

Simón Piga, Nicolás Sanhueza-Matamala

Cycle Decompositions in 3-Uniform Hypergraphs

Pages 1-36 | DOI:10.1007/s00493-023-00001-2

Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena

A Proof of the Multiplicative 1-2-3 Conjecture

Pages 37-55 | DOI:10.1007/s00493-023-00003-0

Tom Kelly, Luke Postle

On the Density of Critical Graphs with No Large Cliques

Pages 57-89 | DOI:10.1007/s00493-023-00007-w

Sławomir Solecki

Dual Ramsey Theorem for Trees

Pages 91-128 | DOI:10.1007/s00493-023-00009-8

Freddie Illingworth

Minimum Degree Stability of H-Free Graphs

Pages 129-147 | DOI:10.1007/s00493-023-00010-1

Assaf Rinot, Jing Zhang

Strongest Transformations

Pages 149-185 | DOI:10.1007/s00493-023-00011-0

Jacob Fox, János Pach, Andrew Suk

Sunflowers in Set Systems of Bounded Dimension

Pages 187-202 | DOI:10.1007/s00493-023-00012-z

Lubotzky, A.; Phillips, R.; Sarnak, P.

Ramanujan graphs

Volume 8 (1988), Issue 3, 261–277

Karmarkar, N.

A new polynomial-time algorithm for linear programming

Volume 4 (1984), Issue 4, 373–395

Grötschel, M.; Lovász, L.; Schrijver, A.

The ellipsoid method and its consequences in combinatorial optimization

Volume 1 (1981), Issue 2, 169–197

Alon, N.

Eigenvalues and expanders

Volume 6 (1986), Issue 2, 83–96

Linial, Nathan; London, Eran; Rabinovich, Yuri

The geometry of graphs and some of its algorithmic applications

Volume 15 (1995), Issue 2, 215–245

Alon, N.; Tarsi, M.

Colorings and orientations of graphs

Volume 12 (1992), Issue 2, 125–134

Chung, F. R. K.; Graham, R. L.; Wilson, R. M.

Quasi-random graphs

Volume 9 (1989), Issue 4, 345–362

Szemerédi, Endre; Trotter, William T., Jr.

Extremal problems in discrete geometry

Volume 3 (1983), Issue 3-4, 381–392

de Fraysseix, H.; Pach, J.; Pollack, R.

How to draw a planar graph on a grid

Volume 10 (1990), Issue 1, 41–51

Frankl, P.; Wilson, R. M.

Intersection theorems with geometric consequences

Volume 1 (1981), Issue 4, 357–368

Godsil, C. D.

On the full automorphism group of a graph

Volume 1 (1981), Issue 3, 243–256

Füredi, Z.; Komlós, J.

The eigenvalues of random symmetric matrices

Volume 1 (1981), Issue 3, 233–241

Frieze, Alan; Kannan, Ravi

Quick approximation to matrices and applications

Volume 19 (1999), Issue 2, 175–220

Komlós, János; Sárközy, Gábor N.; Szemerédi, Endre

Blow-up lemma

Volume 17 (1997), Issue 1, 109–123

Wilson, Richard M.

The exact bound in the Erdős-Ko-Rado theorem

Volume 4 (1984), Issue 2-3, 247–257

Pach, János; Tóth, Géza

Graphs drawn with few crossings per edge

Volume 17 (1997), Issue 3, 427–439

Babai, L.

On Lovász' lattice reduction and the nearest lattice point problem

Volume 6 (1986), Issue 1, 1–13

Mulmuley, Ketan; Vazirani, Umesh V.; Vazirani, Vijay V.

Matching is as easy as matrix inversion

Volume 7 (1987), Issue 1, 105–113

Raghavan, P.; Thompson, C. D.

Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Volume 7 (1987), Issue 4, 365–374

Robertson, Neil; Seymour, Paul; Thomas, Robin

Hadwiger's conjecture for K6-free graphs

Volume 13 (1993), Issue 3, 279–361

Jain, Kamal

A factor 2 approximation algorithm for the generalized Steiner network problem

Volume 21 (2001), Issue 1, 39–60

Bollobás, Béla; Riordan, Oliver

The diameter of a scale-free random graph

Volume 24 (2004), Issue 1, 5–34

Chudnovsky, Maria; Cornuéjols, Gérard; Liu, Xinming; Seymour, Paul; Vušković, Kristina

Recognizing Berge graphs

Volume 25 (2005), Issue 2, 143–186

Alon, Noga; Fischer, Eldar; Krivelevich, Michael; Szegedy, Mario

Efficient testing of large graphs

Volume 20 (2000), Issue 4, 451–476

Tao, Terence

Product set estimates for non-commutative groups

Volume 28 (2008), Issue 5, 547–594

Linial, Nathan; Meshulam, Roy

Homological connectivity of random 2-complexes

Volume 26 (2006), Issue 4, 475–487

Kim, Jeong Han; Vu, Van H.

Concentration of multivariate polynomials and its applications

Volume 20 (2000), Issue 3, 417–434

Thomassé, Stéphan; Yeo, Anders

Total domination of graphs and small transversals of hypergraphs

Volume 27 (2007), Issue 4, 473–487

Goldreich, Oded; Goldwasser, Shafi; Lehman, Eric; Ron, Dana; Samorodnitsky, Alex

Testing monotonicity

Volume 20 (2000), Issue 3, 301–337

Kühn, Daniela; Osthus, Deryk

The minimum degree threshold for perfect graph packings

Volume 29 (2009), Issue 1, 65–107

Sebő, András; Vygen, Jens

Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs

Volume 34 (2014), Issue 5, 597–629

Petridis, Giorgis

New proofs of Plünnecke-type estimates for product sets in groups

Volume 32 (2012), Issue 6, 721–733

Tóth, Csaba D.

The Szemerédi-Trotter theorem in the complex plane

Volume 35 (2015), Issue 1, 95–126

Ceballos, Cesar; Santos, Francisco; Ziegler, Günter M.

Many non-equivalent realizations of the associahedron

Volume 35 (2015), Issue 5, 513–551

Dujmović, Vida; Joret, Gwenaël; Kozik, Jakub; Wood, David R.

Nonrepetitive colouring via entropy compression

Volume 36 (2016), Issue 6, 661–686

Chudnovsky, Maria; Seymour, Paul

The three-in-a-tree problem

Volume 30 (2010), Issue 4, 387–417

Füredi, Zoltán; Jiang, Tao; Seiver, Robert

Exact solution of the hypergraph Turán problem for k-uniform linear paths

Volume 34 (2014), Issue 3, 299–322

Raigorodskii, A. M.

On the chromatic numbers of spheres in Rn

Volume 32 (2012), Issue 1, 111–123

Cilleruelo, Javier

Combinatorial problems in finite fields and Sidon sets

Volume 32 (2012), Issue 5, 497–511

Devos, Matt; Dvořák, Zdeněk; Fox, Jacob; McDonald, Jessica; Mohar, Bojan; Scheide, Diego

A minimum degree condition forcing complete graph immersion

Volume 34 (2014), Issue 3, 279–298

Rudnev, Misha

On the number of incidences between points and planes in three dimensions

Volume 38 (2018), Issue 1, 219–254

If you have any question, please do not hesitate to contact us at

Note that papers can **no longer** be submitted via e-mail:

submission information.

Postal address:

*COMBINATORICA
Rényi Institute of Mathematics
Reáltanoda u. 13-15.
H-1053, Budapest, Hungary*

For information on journal subscription,

please visit
the Springer website.

For orders within Hungary, please contact the

Bolyai Mathematical Society.