OOIR: Observatory of International Research

Papers

(The TQCC of Journal of Combinatorial Theory Series B 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 2021-07-01 to 2025-07-01.)

Article	Citations
A new bound for the Brown–Erdős–Sós problem	21
Editorial Board	18
On the Cayleyness of Praeger-Xu graphs	17
Concentration of maximum degree in random planar graphs	17
On the intersection conjecture for infinite trees of matroids	16
The feasible region of induced graphs	15
Decomposing hypergraphs into cycle factors	15
On 2-cycles of graphs	13
On the use of senders for asymmetric tuples of cliques in Ramsey theory	12
A fast distributed algorithm for (Δ + 1)-edge-coloring	11
Linkages and removable paths avoiding vertices	11
Clustered coloring of (path + 2K1)-free graphs on surfaces	11
Editorial Board	10
Minimal asymmetric hypergraphs	10
Efficiently distinguishing all tangles in locally finite graphs	10
A polynomial version of Cereceda's conjecture	10
A weak box-perfect graph theorem	10
Counting oriented trees in digraphs with large minimum semidegree	9
Characterising graphs with no subdivision of a wheel of bounded diameter	9
Trees with many leaves in tournaments	9
Random homomorphisms into the orthogonality graph	9
Extremal problems for multigraphs	9
Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs	9
The Lovász-Cherkassky theorem in countable graphs	8
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs	8

Determining triangulations and quadrangulations by boundary distances	8
Embedding clique-factors in graphs with low ℓ-independence number	8
Edge-colouring graphs with local list sizes	7
Toward a density Corrádi–Hajnal theorem for degenerate hypergraphs	7
The Erdős Matching Conjecture and concentration inequalities	7
How connectivity affects the extremal number of trees	7
N-detachable pairs in 3-connected matroids III: The theorem	7
A half-integral Erdős-Pósa theorem for directed odd cycles	7
Obstructions for bounded shrub-depth and rank-depth	7
Weak saturation in graphs: A combinatorial approach	7
Orientations of golden-mean matroids	6
Graphs of bounded twin-width are quasi-polynomially χ-bounded	6
A solution of Li-Xia's problem on s-arc-transitive solvable Cayley graphs	6
Tree amalgamations and quasi-isometries	6
EPPA numbers of graphs	6
Reconstructing the degree sequence of a sparse graph from a partial deck	6
Percolation on dense random graphs with given degrees	6
Ramsey number of 1-subdivisions of transitive tournaments	6
Bipartite graphs with no K6 minor	6
Hitting all maximum stable sets in P5-free graphs	6
On objects dual to tree-cut decompositions	6
The inducibility of oriented stars	6
Editorial Board	6
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth	6
Flows on flow-admissible signed graphs	6
Typical structure of hereditary properties of binary matroids	6
Globally rigid powers of graphs	5
The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem	5
Excluding a planar matching minor in bipartite graphs	5
Sharp bounds for the chromatic number of random Kneser graphs	5
Generalized cut trees for edge-connectivity	5
Dirac-type conditions for spanning bounded-degree hypertrees	5
Hamiltonian cycles and 1-factors in 5-regular graphs	5
Counting cycles in planar triangulations	5
Dirac-type theorems in random hypergraphs	5
An improved lower bound of P(G,L)−P(G,k) for k-assignments L	5
Editorial Board	5
Finite matchability under the matroidal Hall's condition	5
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs	5
Treewidth versus clique number. II. Tree-independence number	5
Isomorphic bisections of cubic graphs	4
Turán numbers of r-graphs on r + 1 vertices	4
Minimum algebraic connectivity and maximum diameter: Aldous–Fill and Guiduli–Mohar conjectures	4
Turán problems for edge-ordered graphs	4
A lower bound on the average size of a connected vertex set of a graph	4
The minimum number of clique-saturating edges	4
The multicolor size-Ramsey numbers of cycles	4
The inverse Kazhdan-Lusztig polynomial of a matroid	4
On graph classes with minor-universal elements	4
Countably determined ends and graphs	4

Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles	4
Maximal matroids in weak order posets	4
Graphs with polynomially many minimal separators	4
On locally rainbow colourings	4
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant	4
A splitter theorem on 3-connected binary matroids and inner fans	4
Mutual embeddability in groups, trees, and spheres	4
An extremal problem motivated by triangle-free strongly regular graphs	4
On the central levels problem	3
Editorial Board	3
Edge-partitioning 3-edge-connected graphs into paths	3
On Vizing's edge colouring question	3
The Erdős-Gyárfás function f(n,4<	3
Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs	3
Slow graph bootstrap percolation II: Accelerating properties	3
A unified view of inequalities for distance-regular graphs, part I	3
Editorial Board	3
H-factors in graphs with small independence number	3
Editorial Board	3
Note on disjoint faces in simple topological graphs	3
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree	3
Excluded minors are almost fragile II: Essential elements	3
Triangle-free planar graphs with at most 64	3
Invariants of Tutte partitions and a q-analogue	3
On the cop number of toroidal graphs	3
One-to-one correspondence between interpretations of the Tutte polynomials	3
Improved bounds for zero-sum cycles in Z	3
Dirac-type theorems for long Berge cycles in hypergraphs	3
Strengthening Rödl's theorem	3
Structure in sparse k-critical graphs	3
Grid induced minor theorem for graphs of small degree	3
Extremal problems for pairs of triangles	3
Twin-width can be exponential in treewidth	3