OOIR: Observatory of International Research

Papers

(The median citation count of Combinatorica is 1. 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 2020-03-01 to 2024-03-01.)

Article	Citations
High Order Random Walks: Beyond Spectral Gap	24
Cycle Lengths in Expanding Graphs	12
Explicit Expanders of Every Degree and Size	10
More on the Extremal Number of Subdivisions	9
Generalising the Scattered Property of Subspaces	8
Stack-Number is Not Bounded by Queue-Number	8
Separating Polynomial $$\chi $$-Boundedness from $$\chi $$-Boundedness	7
Tournament Quasirandomness from Local Counting	7
On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems	7
Large Cliques in Hypergraphs with Forbidden Substructures	6
Intersecting Restrictions in Clutters	6
A Finitary Structure Theorem for Vertex-Transitive Graphs of Polynomial Growth	6
On the Directions Determined by a Cartesian Product in an Affine Galois Plane	6
Equiangular Lines in Low Dimensional Euclidean Spaces	5
Expander Graphs — Both Local and Global	5
Ramsey Numbers of Books and Quasirandomness	5
The Satisfiability Threshold For Random Linear Equations	5
Euler Tours in Hypergraphs	5
Probabilistic Refinement of the Asymptotic Spectrum of Graphs	5
A Construction for Clique-Free Pseudorandom Graphs	5
The Characteristic Polynomial of a Random Matrix	4
Resolving The Hamiltonian Problem for Vertex-Transitive Graphs of Order a Product of Two Primes	4
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path	4
Higher Convexity and Iterated Sum Sets	4
On Almost k-Covers of Hypercubes	4

Pure Pairs. II. Excluding All Subdivisions of A Graph	4
Big Ramsey Degrees of 3-Uniform Hypergraphs Are Finite	4
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic	4
On Tight 4-Designs in Hamming Association Schemes	4
Persistent Graphs and Cyclic Polytope Triangulations	3
On an Application of Higher Energies to Sidon Sets	3
Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits	3
Beating the Probabilistic Lower Bound on q-Perfect Hashing	3
The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree	3
On the Density of C7-Critical Graphs	3
Bipartite Turán Problems for Ordered Graphs	3
The Chromatic Number of the Product of 14-Chromatic Graphs Can BE 13	3
On the Asymptotic Confirmation of the Faudree–Lehel Conjecture for General Graphs	3
Note on the Number of Hinges Defined by a Point Set in ℝ2	3
An Analytic Approach to Cardinalities of Sumsets	3
A Large Family of Maximum Scattered Linear Sets of $${{\,\mathrm{{PG}}\,}}(1,q^n)$$ and Their Associated MRD Codes	3
Algebraic Constructions of Complete m-Arcs	3
A Cap Covering Theorem	3
Expanding Polynomials: A Generalization of the Elekes-Rónyai Theorem to d Variables	3
Detecting a Long Odd Hole	3
Impartial Digraphs	3
Seymour’s Conjecture on 2-Connected Graphs of Large Pathwidth	2
Weakly Norming Graphs are Edge-Transitive	2
The Number of Maximal Independent Sets in the Hamming Cube	2
The Language of Self-Avoiding Walks	2
Asymptotics of the Hypergraph Bipartite Turán Problem	2
An Improved Bound for the Linear Arboricity Conjecture	2
On Bounded Degree Graphs with Large Size-Ramsey Numbers	2
Minimum Degree Stability of H-Free Graphs	2
Substitutive Systems and a Finitary Version of Cobham’s Theorem	2
A Hypergraph Turán Problem with No Stability	2
Patterns in Random Permutations	2
Excluding a Ladder	2
Simple Graph Density Inequalities with No Sum of Squares Proofs	2
Treedepth vs Circumference	2
Countable Ordinals and Big Ramsey Degrees	2
Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs	2
An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean function	2
Base Partition for Mixed Families of Finitary and Cofinitary Matroids	2
Non-Bipartite K-Common Graphs	2
Strongest Transformations	2
Fractional Isomorphism of Graphons	2
On the Number of Fixed Points of Automorphisms of Vertex-Transitive Graphs	2
New Results on Simplex-Clusters in Set Systems	2
Universal Planar Graphs for the Topological Minor Relation	1
Spherical Two-Distance Sets and Eigenvalues of Signed Graphs	1
A Generalization of the Chevalley–Warning and Ax–Katz Theorems with a View Towards Combinatorial Number Theory	1
Boolean Dimension and Tree-Width	1
On Decidability of Hyperbolicity	1
Kempe Equivalent List Colorings	1

Strongly Regular Graphs Satisfying the 4-Vertex Condition	1
Pure Pairs. V. Excluding Some Long Subdivision	1
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path	1
Maximal Digraphs with Respect to Primitive Positive Constructability	1
The VC-Dimension of K-Vertex D-Polytopes	1
Number of 1-Factorizations of Regular High-Degree Graphs	1
Weak Saturation of Multipartite Hypergraphs	1
Generalizing Korchmáros—Mazzocca Arcs	1
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12	1
A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions	1
A Book Proof of the Middle Levels Theorem	1
Fractionally Balanced Hypergraphs and Rainbow KKM Theorems	1
Stability Through Non-Shadows	1
Maximal 3-Wise Intersecting Families	1
A Family of Balanced Generalized Weighing Matrices	1
The Sandpile Group of a Trinity and a Canonical Definition for the Planar Bernardi Action	1
Short Directed Cycles in Bipartite Digraphs	1
Constructing Tree-Decompositions That Display All Topological Ends	1
A New Upper Bound on the Chromatic Number of Graphs with No Odd Kt Minor	1
Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs	1
Tight Bounds Towards a Conjecture of Gallai	1
Cycle Traversability for Claw-Free Graphs and Polyhedral Maps	1
Improving the $$\frac{1}{3} - \frac{2}{3}$$ Conjecture for Width Two Posets	1
1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio	1
(2K + 1)-Connected Tournaments with Large Minimum Out-Degree are K-Linked	1
A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols	1
A Group Ring Approach to Fuglede’s Conjecture in Cyclic Groups	1
A Subexponential Size Triangulation of ℝPn	1
Growth in Sumsets of Higher Convex Functions	1
Counting Hamilton Cycles in Dirac Hypergraphs	1
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization — II	1
Bounded VC-Dimension Implies the Schur-Erdős Conjecture	1
Vertex-Coloring Graphs with 4-Edge-Weightings	1
Induced Subgraphs of Induced Subgraphs of Large Chromatic Number	1
The Number of Tangencies Between Two Families of Curves	1
A Characterization of Graphs Whose Small Powers of Their Edge Ideals Have a Linear Free Resolution	1
A Short Proof of Shih’s Isomorphism Theorem on Graphic Subspaces	1
The Edge-Erdős-Pósa Property	1
On Transitive Ovoids of Finite Hermitian Polar Spaces	1
A New Family of Triangulations of ℝPd	1
On the Maximum of the Sum of the Sizes of Non-trivial Cross-Intersecting Families	1
On Non-Empty Cross-Intersecting Families	1
Polynomial Schur’s Theorem	1
Lower Bounds on the Chromatic Number of Random Graphs	1