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 2022-01-01 to 2026-01-01.)

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

Toward a density Corrádi–Hajnal theorem for degenerate hypergraphs	9
Degree-truncated choosability of graphs	8
On graphs without cycles of length 0 modulo 4	8
Edge-colouring graphs with local list sizes	8
How connectivity affects the extremal number of trees	8
Determining triangulations and quadrangulations by boundary distances	8
N-detachable pairs in 3-connected matroids III: The theorem	8
The Lovász-Cherkassky theorem in countable graphs	8
Typical structure of hereditary properties of binary matroids	7
The inducibility of oriented stars	7
Hitting all maximum stable sets in P5-free graphs	7
Finding irregular subgraphs via local adjustments	7
Reconstructing the degree sequence of a sparse graph from a partial deck	7
EPPA numbers of graphs	7
Orientations of golden-mean matroids	7
Weak saturation in graphs: A combinatorial approach	7
The Erdős Matching Conjecture and concentration inequalities	7
Graphs of bounded twin-width are quasi-polynomially χ-bounded	7
A half-integral Erdős-Pósa theorem for directed odd cycles	7
On objects dual to tree-cut decompositions	6
Ramsey number of 1-subdivisions of transitive tournaments	6
Globally rigid powers of graphs	6
Percolation on dense random graphs with given degrees	6
Editorial Board	6
Tree amalgamations and quasi-isometries	6
Weak diameter choosability of graphs with an excluded minor	6
Bipartite graphs with no K6 minor	6
Detachable pairs in 3-connected matroids and simple 3-connected graphs	5
Finite matchability under the matroidal Hall's condition	5
Treewidth versus clique number. II. Tree-independence number	5
An improved lower bound of P(G,L)−P(G,k) for k-assignments L	5
Reuniting χ-boundedness with polynomial χ-boundedness	5
Splitting-off in hypergraphs	5
Dirac-type theorems in random hypergraphs	5
Fast algorithms for Vizing's theorem on bounded degree graphs	5
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth	5
Transversals via regularity	5
Counting cycles in planar triangulations	5
Maximal matroids in weak order posets	4
On graph classes with minor-universal elements	4
Mutual embeddability in groups, trees, and spheres	4
An extremal problem motivated by triangle-free strongly regular graphs	4
On locally rainbow colourings	4
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs	4
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant	4
Turán numbers of r-graphs on r + 1 vertices	4
Graphs with polynomially many minimal separators	4
Countably determined ends and graphs	4
Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles	4
Hamiltonian cycles and 1-factors in 5-regular graphs	4

Editorial Board	4
Excluding a planar matching minor in bipartite graphs	4
The multicolor size-Ramsey numbers of cycles	4
Minimum algebraic connectivity and maximum diameter: Aldous–Fill and Guiduli–Mohar conjectures	4
A splitter theorem on 3-connected binary matroids and inner fans	4
Turán problems for edge-ordered graphs	4
The minimum number of clique-saturating edges	4
Dirac-type conditions for spanning bounded-degree hypertrees	4
Sharp bounds for the chromatic number of random Kneser graphs	4
Generalized cut trees for edge-connectivity	4
Edge-partitioning 3-edge-connected graphs into paths	3
Improved bounds for zero-sum cycles in Z	3
Extremal problems for pairs of triangles	3
Editorial Board	3
Editorial Board	3
Slow graph bootstrap percolation II: Accelerating properties	3
Strengthening Rödl's theorem	3
On Vizing's edge colouring question	3
A lower bound on the average size of a connected vertex set of a graph	3
Note on disjoint faces in simple topological graphs	3
H-factors in graphs with small independence number	3
Twin-width can be exponential in treewidth	3
Dirac-type theorems for long Berge cycles in hypergraphs	3
One-to-one correspondence between interpretations of the Tutte polynomials	3
Structure in sparse k-critical graphs	3
Editorial Board	3
On the central levels problem	3
Invariants of Tutte partitions and a q-analogue	3
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree	3