OOIR: Observatory of International Research

Papers

(The TQCC of Combinatorica is 2. 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
Tournament Quasirandomness from Local Counting	7
On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems	7
Separating Polynomial $$\chi $$-Boundedness from $$\chi $$-Boundedness	7
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
Large Cliques in Hypergraphs with Forbidden Substructures	6
Intersecting Restrictions in Clutters	6
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
Equiangular Lines in Low Dimensional Euclidean Spaces	5
Expander Graphs — Both Local and Global	5
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
The Characteristic Polynomial of a Random Matrix	4
Resolving The Hamiltonian Problem for Vertex-Transitive Graphs of Order a Product of Two Primes	4
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
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
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
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