European Journal of Combinatorics

Papers
(The TQCC of European Journal of Combinatorics 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 2022-06-01 to 2026-06-01.)
ArticleCitations
Pendant appearances and components in random graphs from structured classes24
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation22
An identity of Ramanujan and its combinatorics19
On minimal actions of countable groups15
On the size of (K15
A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors13
Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović11
Degree conditions for Ramsey goodness of paths10
Rainbow clique subdivisions10
On the C 10
The Alon–Tarsi number of a toroidal grid9
A duality theorem for the ic-resurgence of edge ideals9
Quasisymmetric Schur Q 9
Clique immersions and independence number9
A characterization of positroids, with applications to amalgams and excluded minors9
An algebraic approach for counting DP-3-colorings of sparse graphs8
A note on non-empty cross-intersecting families8
Toric Richardson varieties of Catalan type and Wedderburn–Etherington numbers8
Coloring circle arrangements: New 4-chromatic planar graphs8
The extensible No-Three-In-Line problem7
Skew key polynomials and a generalized Littlewood–Richardson rule7
Polynomial bounds for chromatic number VI. Adding a four-vertex path7
Walks avoiding a quadrant and the reflection principle7
Continuously increasing subsequences of random multiset permutations7
On the maximum number of common neighbours in dense random regular graphs7
Clustered coloring of graphs with bounded layered treewidth and bounded degree7
Subdivisions in dicritical digraphs with large order or digirth7
Stability theorems for some Kruskal–Katona type results7
A new bound for the Maker–Breaker triangle game7
Editorial Board6
Rainbow connectivity and rainbow index of inhomogeneous random graphs6
Rectangulotopes6
Induced Turán problems and traces of hypergraphs6
Ramsey expansions of Λ-ultrametric spaces6
Almost orthogonal subsets of vector spaces over finite fields6
Stanley–Wilf limits for patterns in rooted labeled forests6
Editorial Board6
Perfect matroids over skew hyperfields6
Parity biases in partitions and restricted partitions6
Fundamental quasisymmetric functions in superspace5
List strong and list normal edge-coloring of (sub)cubic graphs5
Improved bounds for the dimension of divisibility5
Shape of the asymptotic maximum sum-free sets in integer lattice grids5
Precoloring extension in planar near-Eulerian-triangulations5
Improved upper bound on the Frank number of 3-edge-connected graphs5
On the restricted sumsets containing powers of an integer5
Clique covers of H-free graphs5
Editorial Board5
On sum-intersecting families of positive integers5
Minimum degree ensuring that a hypergraph is hamiltonian-connected5
Quasiplanar graphs, string graphs, and the Erdős–Gallai problem5
Partial-dual genus polynomial of graphs4
Crystal pop-stack sorting and type A crystal lattices4
Dual Ramsey properties for classes of algebras4
Transducing paths in graph classes with unbounded shrubdepth4
Higher q-continued fractions4
Induced subdivisions with pinned branch vertices4
Finding strong components using depth-first search4
Symmetry and Pieri rules for the bisymmetric Macdonald polynomials4
Factor-of-iid balanced orientation of non-amenable graphs4
MSO undecidability for hereditary classes of unbounded clique-width4
Coloring zonotopal quadrangulations of the projective space4
Sum-distinguishing number of sparse hypergraphs4
Strong parity edge-colorings of graphs4
P-strict promotion and 4
Generalized Ramsey numbers of cycles, paths, and hypergraphs4
When all directed cycles have length three4
Intersection theorems for (4
Odd-Ramsey numbers of complete bipartite graphs4
Partitioning the projective plane and the dunce hat4
Asymmetric edge-colorings of graphs with three colors4
Approximating fractionally isomorphic graphons4
Preface4
Editorial Board4
When removing an independent set is optimal for reducing the chromatic number4
Guarding isometric subgraphs and cops and robber in planar graphs4
Characterizations of families of morphisms and words via binomial complexities4
Hardness of the generalized coloring numbers4
Majority bootstrap percolation on the permutahedron and other high-dimensional graphs3
Spined categories: Generalizing tree-width beyond graphs3
Kempe changes in degenerate graphs3
On the structures of subset sums in higher dimension3
Terrain-like graphs and the median Genocchi numbers3
Wachs permutations, Bruhat order and weak order3
Enumeration of standard barely set-valued tableaux of shifted shapes3
Non-existence of two infinite families of strongly regular graphs3
On the Δ 3
Minors, connectivity, and diameter in randomly perturbed sparse graphs3
Editorial Board3
Spanning hypertrees, vertex tours and meanders3
The rotation distance of brooms3
Comparing width parameters on graph classes3
Thresholds for constrained Ramsey and anti-Ramsey problems3
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal3
On degree powers and counting stars in F-free graphs3
Fragile minor-monotone parameters under a random edge perturbation3
The (k,l)-Euler theorem and the combinatorics of (k,l)-sequences3
The Erdős–Ko–Rado theorem in 3
New necessary conditions for the existence of finite non-Desarguesian flag-transitive projective planes3
Intersections and distinct intersections in cross-intersecting families3
Borel sets of Rado graphs and Ramsey’s theorem3
Editorial Board3
Some snarks are worse than others3
The bunkbed conjecture is not robust to generalisation3
List-recoloring of sparse graphs3
A self-conjugate partition analog of 3
Almost unimodal and real-rooted graph polynomials3
Partial geometric designs arising from association schemes3
Ramsey goodness of k-uniform paths, or the lack thereof3
Finite Ramsey degrees and Fraïssé expansions with the Ramsey property3
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics3
Spanning subdivisions in dense digraphs3
Homotopy types of Hom complexes of graph homomorphisms whose codomains are square-free3
When (signless) Laplacian coefficients meet matchings of subdivision3
The sum of all width-one matrices3
Generalized Turán problem for a path and a clique3
On the cancellation-free antipode formula for the Malvenuto–Reutenauer Hopf Algebra3
On the spectrum and linear programming bound for hypergraphs3
Separating rank 3 graphs3
Stack and queue numbers of graphs revisited3
Kalai’s conjecture in r-partite 3
The asymptotic uniform distribution of subset sums3
Editorial Board2
Editorial Board2
Vertex-weighted digraphs and freeness of arrangements between Shi and Ish2
Neighbourhood complexity of graphs of bounded twin-width2
Preface2
Generating functions for fixed points of the Mullineux map2
On colourability of polygon visibility graphs2
A variant of the Erdős–Gyárfás problem for 2
High dimensional expanders and coset geometries2
On the order of semiregular automorphisms of cubic vertex-transitive graphs2
Minimum weight Euclidean (12
Partitioning a 2-edge-coloured graph of minimum degree 2n2
A decomposition of cylindric partitions and cylindric partitions into distinct parts2
The maximum number of cliques in graphs with prescribed order, circumference and minimum degree2
The permuto-associahedron revisited2
Counting deranged matchings2
Constructing sparsest -hamiltonian saturated 2
High-dimensional expanders from Kac–Moody–Steinberg groups2
Meanders: A personal perspective to the memory of Pierre Rosenstiehl2
Minimum degree conditions for containing an r-regular 2
Real stable polynomials and the alternatingly increasing property2
Weak diameter coloring of graphs on surfaces2
Minimally globally rigid graphs2
Unions of intervals in codes based on powers of sets2
Ramsey numbers of cliques versus monotone paths2
Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph2
Editorial Board2
A polynomial upper bound for poset saturation2
Erdős–Ko–Rado type results for partitions via spread approximations2
1-planar unit distance graphs2
Deformation cones of graph associahedra and nestohedra2
Generalizing Körner’s graph entropy to graphons2
Editorial Board2
Giant rainbow trees in sparse random graphs2
A counterexample to the Ross–Yong conjecture for Grothendieck polynomials2
Polynomials related to q 2
Dense sumsets of Sidon sequences2
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole2
Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements2
Reconfiguring homomorphisms to reflexive graphs via a simple reduction2
On k-neighborly reorientations of oriented matroids2
Decomposing a triangle-free planar graph into a forest and a subcubic forest2
Characteristic sets of matroids2
Editorial Board2
Improved bounds on the maximum diversity of intersecting families2
The Weighted Davenport constant of a group and a related extremal problem-II2
Editorial Board2
Descents on nonnesting multipermutations2
Unimodality and certain bivariate formal Laurent series2
Note on a problem of Sárközy on multiplicative representation functions2
Editorial Board2
Large Y3,2
Stable sets in flag spheres2
Boundary rigidity of 3D CAT(0) cube complexes2
Building graphs with high minimum degree on a budget2
In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent2
Improved incidence bounds over arbitrary finite fields via the VC-dimension theory2
Critically intersecting hypergraphs2
Beyond the pseudoforest strong Nine Dragon Tree Theorem2
On the maximum number of edges in hypergraphs with fixed matching and clique number2
The Frank number and nowhere-zero flows on graphs2
The semi-random tree process2
Editorial Board2
Aldous’ spectral gap property for normal Cayley graphs on symmetric groups2
Combinatorial interpretations of truncated series from the Jacobi triple product identity2
Homomorphism complexes, reconfiguration, and homotopy for directed graphs2
Online coloring of short intervals2
Stability properties for subgroups generated by return words2
Stability of extremal connected hypergraphs avoiding Berge-paths2
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths2
Signed Mahonian polynomials on derangements in classical Weyl groups2
Growth rates of permutations with given descent or peak set2
Deletion–contraction and the surface Tutte polynomial2
Maximizing the number of rational-value sums or zero-sums2
Generalized quasikernels in digraphs2
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment2
0.17574501037598