Combinatorica

Papers
(The median citation count of Combinatorica is 0. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-04-01 to 2025-04-01.)
ArticleCitations
Upper Tail Behavior of the Number of Triangles in Random Graphs with Constant Average Degree12
Bounding the Chromatic Number of Dense Digraphs by Arc Neighborhoods11
Large Independent Sets from Local Considerations10
Hamming Sandwiches9
Defective Coloring is Perfect for Minors8
Upper Bounds For Families Without Weak Delta-Systems7
Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs7
Boolean Function Analysis on High-Dimensional Expanders7
Bounds on the Number of Compatible k-Simplices Matching the Orientation of the (k − 1)-Skeleton of a Simplex7
Simplicial Spanning Trees in Random Steiner Complexes7
A Characterization of Graphs Whose Small Powers of Their Edge Ideals Have a Linear Free Resolution6
A Topological Version of Hedetniemi’s Conjecture for Equivariant Spaces6
An Explicit Infinite Family of $$\mathbb{M}$$-Vertex Graphs with Maximum Degree K and Diameter $$\left[ {1 + o\left( 1 \right)} \right]{\log _{K - 1}\mathbb{M}}$$ for Each K − 1 a Prime Power6
Induced Subgraphs of Induced Subgraphs of Large Chromatic Number5
Kempe Equivalent List Colorings5
The Signed Varchenko Determinant for Complexes of Oriented Matroids5
Constructing Tree-Decompositions That Display All Topological Ends5
Stack-Number is Not Bounded by Queue-Number5
Vertex-Minor-Closed Classes are χ-Bounded5
A Short Proof of the Blow-Up Lemma for Approximate Decompositions5
Pure Pairs. II. Excluding All Subdivisions of A Graph4
Pure Pairs. V. Excluding Some Long Subdivision4
Supersaturation Beyond Color-Critical Graphs4
On the Density of C7-Critical Graphs4
Bounds on the Mod 2 Homology of Random 2-Dimensional Determinantal Hypertrees4
Turán Density of Long Tight Cycle Minus One Hyperedge4
Erratum to: Arc Connectivity and Submodular Flows in Digraphs3
Substitutive Systems and a Finitary Version of Cobham’s Theorem3
6-Uniform Maker-Breaker Game is PSPACE-Complete3
The Sandpile Group of a Trinity and a Canonical Definition for the Planar Bernardi Action3
Minimum Degree Stability of H-Free Graphs3
A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt3
Resolving The Hamiltonian Problem for Vertex-Transitive Graphs of Order a Product of Two Primes3
Maximal Digraphs with Respect to Primitive Positive Constructability3
Log-Concavity in Planar Random Walks3
Convergence and Limits of Finite Trees3
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path3
A Hypergraph Turán Problem with No Stability3
Perfect Matchings in Random Sparsifications of Dirac Hypergraphs2
The Ramsey Properties for Grassmannians Over ℝ, ℂ2
A Local Version of Katona’s Intersecting Shadow Theorem2
Bounded Cutoff Window for the Non-backtracking Random Walk on Ramanujan Graphs2
Bounded VC-Dimension Implies the Schur-Erdős Conjecture2
Routing Permutations on Spectral Expanders via Matchings2
An Analytic Approach to Cardinalities of Sumsets2
Kissing Numbers of Regular Graphs2
Uniacute Spherical Codes2
Maximal 3-Wise Intersecting Families2
The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree2
Tiling Edge-Coloured Graphs with Few Monochromatic Bounded-Degree Graphs2
Prague Dimension of Random Graphs2
Separating Polynomial $$\chi $$-Boundedness from $$\chi $$-Boundedness2
On the Critical Exponent for k-Primitive Sets2
The Excluded Minors for Embeddability into a Compact Surface2
A Necessary and Sufficient Condition for $$(2d-2)$$-Transversals in $$\mathbb {R}^{2d}$$2
Component Games on Random Graphs2
Sunflowers in Set Systems of Bounded Dimension2
On Bounding the Diameter of a Distance-Regular Graph2
Integer Multiflows in Acyclic Planar Digraphs2
Improved Lower Bound Towards Chen–Chvátal Conjecture1
Probabilistic Refinement of the Asymptotic Spectrum of Graphs1
New Constructions of Group-Invariant Butson Hadamard Matrices1
A Recursive Theta Body for Hypergraphs1
Cycle Decompositions in 3-Uniform Hypergraphs1
A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions1
Treedepth vs Circumference1
Fractionally Balanced Hypergraphs and Rainbow KKM Theorems1
Polynomial Schur’s Theorem1
Spherical Two-Distance Sets and Eigenvalues of Signed Graphs1
Unfriendly Partition Conjecture Holds for Line Graphs1
A Lower Bound for the Number of Pinned Angles Determined by a Cartesian Product Set1
Min–Max Partitioning of Hypergraphs and Symmetric Submodular Functions1
A Group Ring Approach to Fuglede’s Conjecture in Cyclic Groups1
Erratum to: High Order Random Walks: Beyond Spectral Gap1
A Lower Bound for Essential Covers of the Cube1
On the Number of Fixed Points of Automorphisms of Vertex-Transitive Graphs1
Dual Ramsey Theorem for Trees1
Flashes and Rainbows in Tournaments1
Calculating the Euler Characteristic of the Moduli Space of Curves1
An Improved Bound for the Linear Arboricity Conjecture1
On the Ramsey-Turán Density of Triangles1
A Subexponential Size Triangulation of ℝPn1
Improved Integrality Gap in Max–Min Allocation, or, Topology at the North Pole1
Beating the Probabilistic Lower Bound on q-Perfect Hashing1
On the Generating Rank and Embedding Rank of the Hexagonic Lie Incidence Geometries1
On Bounded Degree Graphs with Large Size-Ramsey Numbers1
On the Classification of Low-Degree Ovoids of Q(4,q)1
A Solution to Babai’s Problems on Digraphs with Non-diagonalizable Adjacency Matrix1
Rainbow Cycles in Properly Edge-Colored Graphs1
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 121
Lower Bounds on the Chromatic Number of Random Graphs1
Extractors for Small Zero-Fixing Sources1
On the Zarankiewicz Problem for Graphs with Bounded VC-Dimension1
Packing Directed Cycles Quarter- and Half-Integrally1
On the Maximum of the Sum of the Sizes of Non-trivial Cross-Intersecting Families1
Counting Hamilton Cycles in Dirac Hypergraphs1
Ramsey Numbers of Books and Quasirandomness1
Induced Subgraphs of $$K_r$$-Free Graphs and the Erdős–Rogers Problem1
Hamilton Transversals in Tournaments1
The Characteristic Polynomial of a Random Matrix1
On the Directions Determined by a Cartesian Product in an Affine Galois Plane1
L-Systems and the Lovász Number0
Universal Planar Graphs for the Topological Minor Relation0
A Factor Matching of Optimal Tail Between Poisson Processes0
A Book Proof of the Middle Levels Theorem0
Ramsey Problems for Monotone Paths in Graphs and Hypergraphs0
Oriented Cycles in Digraphs of Large Outdegree0
Tight Bounds Towards a Conjecture of Gallai0
A Positive Answer to Bárány’s Question on Face Numbers of Polytopes0
On the Chevalley-Warning Theorem When the Degree Equals the Number of Variables0
Asymptotics of the Hypergraph Bipartite Turán Problem0
Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs0
Computing the Covering Radius of a Polytope with an Application to Lonely Runners0
Value Distributions of Perfect Nonlinear Functions0
Globally Linked Pairs of Vertices in Generic Frameworks0
Bounding the Diameter and Eigenvalues of Amply Regular Graphs via Lin–Lu–Yau Curvature0
Strongly Regular Graphs Satisfying the 4-Vertex Condition0
Kempe Equivalence Classes of Cubic Graphs Embedded on the Projective Plane0
The Universality of the Resonance Arrangement and Its Betti Numbers0
How Balanced Can Permutations Be?0
Non-Bipartite K-Common Graphs0
Chiral Extensions of Regular Toroids0
A combinatorial proof of a sumset conjecture of Furstenberg0
A Hypergraph Analog of Dirac’s Theorem for Long Cycles in 2-Connected Graphs0
The Number of Tangencies Between Two Families of Curves0
Pure Pairs. VIII. Excluding a Sparse Graph0
Even Maps, the Colin de Verdière Number and Representations of Graphs0
Improved Upper Bound for the Size of a Trifferent Code0
Rainbow Variations on a Theme by Mantel: Extremal Problems for Gallai Colouring Templates0
Improved Lower Bounds for Van Der Waerden Numbers0
Three Early Problems on Size Ramsey Numbers0
Leray Numbers of Tolerance Complexes0
The Number of Maximal Independent Sets in the Hamming Cube0
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path0
Note on the Theorem of Balog, Szemerédi, and Gowers0
Enclosing Depth and Other Depth Measures0
A Hypergraph Bipartite Turán Problem with Odd Uniformity0
The Number of Colorings of the Middle Layers of the Hamming Cube0
Arc Connectivity and Submodular Flows in Digraphs0
On Pisier Type Theorems0
Finding a Shortest Non-Zero Path in Group-Labeled Graphs0
Stability Through Non-Shadows0
A Structural Theorem for Sets with Few Triangles0
Fractional Isomorphism of Graphons0
Sets of r-Graphs that Color All r-Graphs0
Vertex-Coloring Graphs with 4-Edge-Weightings0
Almost Sharp Bounds on the Number of Discrete Chains in the Plane0
Voltage Operations on Maniplexes, Polytopes and Maps0
List-k-Coloring H-Free Graphs for All $$k>4$$0
On the Asymptotic Confirmation of the Faudree–Lehel Conjecture for General Graphs0
The Number of Topological Types of Trees0
On Gardner’s Conjecture0
Bounded-Diameter Tree-Decompositions0
Any Two-Coloring of the Plane Contains Monochromatic 3-Term Arithmetic Progressions0
Algebraic Constructions of Complete m-Arcs0
A Large Family of Maximum Scattered Linear Sets of $${{\,\mathrm{{PG}}\,}}(1,q^n)$$ and Their Associated MRD Codes0
Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs0
On Directed and Undirected Diameters of Vertex-Transitive Graphs0
On an Application of Higher Energies to Sidon Sets0
Constructing New Geometries: A Generalized Approach to Halving for Hypertopes0
On Non-Empty Cross-Intersecting Families0
Weak Saturation of Multipartite Hypergraphs0
Euler’s Theorem for Regular CW-Complexes0
Reconstruction in One Dimension from Unlabeled Euclidean Lengths0
Solution to a Problem of Grünbaum on the Edge Density of 4-Critical Planar Graphs0
Excluding a Ladder0
A New Bound for the Fourier-Entropy-Influence Conjecture0
On Decidability of Hyperbolicity0
Second-Order Bounds on Correlations Between Increasing Families0
List-Avoiding Orientations0
A Generalization of the Chevalley–Warning and Ax–Katz Theorems with a View Towards Combinatorial Number Theory0
A Combinatorial Bijection on k-Noncrossing Partitions0
Strongest Transformations0
Criticality in Sperner’s Lemma0
$$\Gamma $$-Graphic Delta-Matroids and Their Applications0
Lattice Path Matroids and Quotients0
A Cap Covering Theorem0
A Proof of the Multiplicative 1-2-3 Conjecture0
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization — II0
Three-Cuts are a Charm: Acyclicity in 3-Connected Cubic Graphs0
Unavoidable Flats in Matroids Representable over Prime Fields0
(2K + 1)-Connected Tournaments with Large Minimum Out-Degree are K-Linked0
An Upper Bound for the Height of a Tree with a Given Eigenvalue0
A Family of Balanced Generalized Weighing Matrices0
Small Subgraphs with Large Average Degree0
On Unique Sums in Abelian Groups0
Bipartite Turán Problems for Ordered Graphs0
Finding Certain Arithmetic Progressions in 2-Coloured Cyclic Groups0
Growth in Sumsets of Higher Convex Functions0
A Proof of a Frankl–Kupavskii Conjecture on Intersecting Families0
A Unifying Framework for the $$\nu $$-Tamari Lattice and Principal Order Ideals in Young’s Lattice0
Sweeps, Polytopes, Oriented Matroids, and Allowable Graphs of Permutations0
On Thin Sum-Product Bases0
Publisher Erratum: Flashes and Rainbows in Tournaments0
Big Ramsey Degrees of 3-Uniform Hypergraphs Are Finite0
More on the Extremal Number of Subdivisions0
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs0
Equiangular Lines in Low Dimensional Euclidean Spaces0
A New Upper Bound on the Chromatic Number of Graphs with No Odd Kt Minor0
The Chromatic Number of the Product of 5-Chromatic Graphs can be 40
Stronger Counterexamples to the Topological Tverberg Conjecture0
A Finitary Structure Theorem for Vertex-Transitive Graphs of Polynomial Growth0
The Ungar Games0
Storage Codes on Coset Graphs with Asymptotically Unit Rate0
The Strong Nine Dragon Tree Conjecture is True for $$d \le k + 1$$0
On the Density of Critical Graphs with No Large Cliques0
Higher Convexity and Iterated Sum Sets0
A Lower Bound on the Number of Homotopy Types of Simplicial Complexes on N Vertices0
The Asymptotic Number of Score Sequences0
Realizing an m-Uniform Four-Chromatic Hypergraph with Disks0
Gadget Construction and Structural Convergence0
The Chromatic Number of the Product of 14-Chromatic Graphs Can BE 130
A Whitney Type Theorem for Surfaces: Characterising Graphs with Locally Planar Embeddings0
Neighborhood Complexity of Planar Graphs0
Balanced Subdivisions of Cliques in Graphs0
Links and the Diaconis–Graham Inequality0
Effective Results on the Size and Structure of Sumsets0
A Large Family of Strongly Regular Graphs with Small Weisfeiler-Leman Dimension0
Anticoncentration of Random Vectors via the Strong Perfect Graph Theorem0
Effective Bounds for Induced Size-Ramsey Numbers of Cycles0
0.064314126968384