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.

Editors-in-Chief

József Balogh, University of Illinois
József Solymosi, University of British Columbia

Founding editors

László Babai, University of Chicago
László Lovász, ELTE Eötvös University, Budapest

Managing editors

Csaba Király, ELTE Eötvös University, Budapest
Zoltán Lóránt Nagy, 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

Honorary editors

Gyula O.H. Katona, Rényi Institute of Mathematics, Budapest
Miklós Simonovits, Rényi Institute of Mathematics, Budapest
Endre Szemerédi, Rényi Institute of Mathematics, Budapest

Board of editors

Miklós Abért, Rényi Institute of Mathematics, Budapest
Noga Alon, Tel Aviv University & Princeton University
Imre Bárány, Rényi Institute of Mathematics, Budapest
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, University of Bonn
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

Instructions for authors

1. Submission. Manuscripts should be submitted via the editorial system EditFlow. Please use the following link: https://ef.msp.org/submit/combinatorica
2. 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.
3. Notes. Short notes are welcome and processed in an expedited fashion.
4. 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).
5. 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.

Volume 46, Issue 1, 2026

Chi Hoi Yip
Multiplicative irreducibility of small perturbations of the set of shifted k-th powers
46:1  |  DOI:10.1007/s00493-025-00193-9

Luka Milićević
Good Bounds for Sets Lacking Skew Corners
46:2  |  DOI:10.1007/s00493-025-00196-6

Liran Rotem, Alon Schejter, Boaz A. Slomka
The complex Illumination problem
46:3  |  DOI:10.1007/s00493-025-00195-7

Elías Mochán
Semiregular Abstract Polyhedra with Trivial Facet Stabilizer
46:4  |  DOI:10.1007/s00493-025-00197-5

Matthew Kwan, Roodabeh Safavi, Yiting Wang
Counting Perfect Matchings in Dirac Hypergraphs
46:5  |  DOI:10.1007/s00493-025-00194-8

Kristóf Bérczi, Márton Borbényi, László Lovász, László Márton Tóth
Quotient-Convergence of Submodular Setfunctions
46:6  |  DOI:10.1007/s00493-026-00199-x

Thomas F. Bloom, Jakob Führer, Oliver Roche-Newton
Additive Structure in Convex Sets
46:7  |  DOI:10.1007/s00493-026-00200-7

Jinha Kim
Topology of Independence Complexes and Cycle Structure of Hypergraphs
46:8  |  DOI:10.1007/s00493-026-00198-y

Volume 45, Issue 6, 2025

Joanna Boyland, William Gasarch, Nathan Hurtig, Robert Rust
Big Ramsey Degrees of Countable Ordinals
45:57  |  DOI:10.1007/s00493-025-00185-9

József Balogh, Anton Bernshteyn, Michelle Delcourt, Asaf Ferber, Huy Tuan Pham
Sunflowers in Set Systems with Small VC-Dimension
45:58  |  DOI:10.1007/s00493-025-00186-8

Seth Pettie, Gábor Tardos
A Refutation of the Pach-Tardos Conjecture for 0–1 Matrices
45:59  |  DOI:10.1007/s00493-025-00187-7

Jacob Fox, Rajko Nenadov, Huy Tuan Pham
The Largest Subgraph Without A Forbidden Induced Subgraph
45:60  |  DOI:10.1007/s00493-025-00190-y

Sandra Albrechtsen, Raphael W. Jacobs, Paul Knappe, Paul Wollan
A Characterisation of Graphs Quasi-isometric to K4-minor-free Graphs
45:61  |  DOI:10.1007/s00493-025-00189-5

Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
The Grid-Minor Theorem Revisited
45:62  |  DOI:10.1007/s00493-025-00168-w

Simon Griffiths, Letícia Mattos
Clique packings in random graphs
45:63  |  DOI:10.1007/s00493-025-00188-6

Lucas Aragão, Jonathan Chapman, Miquel Ortega, Victor Souza
On the number of monochromatic solutions to multiplicative equations
45:64  |  DOI:10.1007/s00493-025-00183-x

Karim Alexander Adiprasito, Kaiying Hou, Daishi Kiyohara, Daniel Koizumi, Monroe Stephenson
p-Anisotropy on the Moment Curve for Homology Manifolds and Cycles
45:65  |  DOI:10.1007/s00493-025-00192-w

Deping Song, Xuding Zhu
Bound on Shortest Cycle Covers
45:66  |  DOI:10.1007/s00493-025-00191-x

Volume 45, Issue 5, 2025

Nikolai Terekhov, Maksim Zhukovskii
Weak saturation rank: a failure of the linear algebraic approach to weak saturation
45:45  |  DOI:10.1007/s00493-025-00174-y

Ron Aharoni, Eli Berger, He Guo, Dani Kotlar
Coloring, list coloring, and fractional coloring in intersections of matroids
45:46  |  DOI:10.1007/s00493-025-00178-8

Vincent Pfenninger
On k-uniform Tight Cycles: the Ramsey Number for Ckkn and an Approximate Lehel’s Conjecture
45:47  |  DOI:10.1007/s00493-025-00173-z

Lars Becker, Paata Ivanisvili, Dmitry Krachun, José Madrid
Discrete Brunn–Minkowski inequality for subsets of the cube
45:48  |  DOI:10.1007/s00493-025-00180-0

Tung Nguyen, Alex Scott, Paul Seymour
Trees and near-linear stable sets
45:49  |  DOI:10.1007/s00493-025-00177-9

Jan Hubička, Colin Jahel, Matěj Konečný, Marcin Sabok
Extension Property for Partial Automorphisms of the n-partite and Semigeneric Tournaments
45:50  |  DOI:10.1007/s00493-025-00179-7

Yunsong Gan, Pablo Spiga, Binzhou Xia
Asymptotic Enumeration of Haar Graphical Representations
45:51  |  DOI:10.1007/s00493-025-00175-x

Miloš Trujić
Blow-up Lemma for Cycles in Sparse Random Graphs
45:52  |  DOI:10.1007/s00493-025-00171-1

Rutger Campbell, Jim Geelen, Matthew E. Kroeker
Average plane-size in complex-representable matroids
45:53  |  DOI:10.1007/s00493-025-00181-z

Jindřich Zapletal
Triangles and Vitali Sets
45:54  |  DOI:10.1007/s00493-025-00182-y

Đorđe Mitrović, Jeroen Schillewaert, Hendrik Van Maldeghem
Local recognition of affine rank 3 graphs
45:55  |  DOI:10.1007/s00493-025-00176-w

József Balogh, Michael C. Wigal
Packing edge disjoint cliques in graphs
45:56  |  DOI:10.1007/s00493-025-00184-w

Top 20 most-cited papers (1981-1999)

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

Top 10 most-cited papers (2000-2009)

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

Top 10 most-cited papers (2010-2019)

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