OOIR: Observatory of International Research

Papers

(The TQCC of Combinatorica is 3. 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 2022-08-01 to 2026-08-01.)

Article	Citations
Large Independent Sets from Local Considerations	25
Simplicial Spanning Trees in Random Steiner Complexes	14
Signed graphs with the same even cycles	14
A Refutation of the Pach-Tardos Conjecture for 0–1 Matrices	12
Maximal 3-Wise Intersecting Families	9
Turán Density of Long Tight Cycle Minus One Hyperedge	9
Erratum to: Arc Connectivity and Submodular Flows in Digraphs	9
A Characterization of Graphs Whose Small Powers of Their Edge Ideals Have a Linear Free Resolution	9
A Lower Bound for Essential Covers of the Cube	8
Exact Results on Traces of Sets	8
Bound on Shortest Cycle Covers	8
A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions	7
On the Chevalley-Warning Theorem When the Degree Equals the Number of Variables	7
Two Disjoint Alternating Paths in Bipartite Graphs: Conformal Crosses	7
Counting Perfect Matchings in Dirac Hypergraphs	7
Towards an Optimal Hypergraph Container Lemma	7
Finding Certain Arithmetic Progressions in 2-Coloured Cyclic Groups	7
Polynomial Schur’s Theorem	6
Finding a Shortest Non-Zero Path in Group-Labeled Graphs	6
Small Subgraphs with Large Average Degree	6
Asymptotic Enumeration of Haar Graphical Representations	6
Weak saturation rank: a failure of the linear algebraic approach to weak saturation	5
A Whitney Type Theorem for Surfaces: Characterising Graphs with Locally Planar Embeddings	5
Writing Finite Simple Groups of Lie Type as Products of Subset Conjugates	5
Tangle-tree duality in infinite graphs	5

On the Density of Critical Graphs with No Large Cliques	5
Storage Codes on Coset Graphs with Asymptotically Unit Rate	5
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path	5
The Ungar Games	5
Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs	5
Asymptotics of the Hypergraph Bipartite Turán Problem	5
Pure Pairs. VIII. Excluding a Sparse Graph	5
A Topological Version of Hedetniemi’s Conjecture for Equivariant Spaces	4
Turán Problems for Expanded Hypergraphs	4
A Structural Theorem for Sets with Few Triangles	4
Voltage Operations on Maniplexes, Polytopes and Maps	4
Neighborhood Complexity of Planar Graphs	4
Vertex-Coloring Graphs with 4-Edge-Weightings	4
A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt	4
Small Families of Partially Shattering Permutations	4
Hamming Sandwiches	4
A Hypergraph Analog of Dirac’s Theorem for Long Cycles in 2-Connected Graphs	4
Constructing New Geometries: A Generalized Approach to Halving for Hypertopes	4
Topology of Independence Complexes and Cycle Structure of Hypergraphs	4
Upper Bounds For Families Without Weak Delta-Systems	4
Extension Property for Partial Automorphisms of the n-partite and Semigeneric Tournaments	4
Local h-polynomials, Uniform Triangulations and Real-rootedness	4
Balanced Subdivisions of Cliques in Graphs	4
Sets of r-Graphs that Color All r-Graphs	4
A Characterisation of Graphs Quasi-isometric to $$K_4$$-minor-free Graphs	3
Isomorphisms Between Dense Random Graphs	3
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path	3
Any Two-Coloring of the Plane Contains Monochromatic 3-Term Arithmetic Progressions	3
Tight Bounds Towards a Conjecture of Gallai	3
Gadget Construction and Structural Convergence	3
Triangles and Vitali Sets	3
Packing Directed Cycles Quarter- and Half-Integrally	3
Uniacute Spherical Codes	3
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs	3
L-Systems and the Lovász Number	3
Links and the Diaconis–Graham Inequality	3
Discrete Brunn–Minkowski inequality for subsets of the cube	3
A Group Ring Approach to Fuglede’s Conjecture in Cyclic Groups	3
Improved Lower Bound Towards Chen–Chvátal Conjecture	3
Component Games on Random Graphs	3
Ruzsa’s Problem on Bi-Sidon Sets	3
$$\Gamma $$-Graphic Delta-Matroids and Their Applications	3
Arc Connectivity and Submodular Flows in Digraphs	3
The Largest Subgraph Without A Forbidden Induced Subgraph	3