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 2021-04-01 to 2025-04-01.)
ArticleCitations
Some exact results of the generalized Turán numbers for paths38
Walks avoiding a quadrant and the reflection principle34
Saturation numbers for Berge cliques27
On Helly numbers of exponential lattices20
An identity of Ramanujan and its combinatorics14
On Rado conditions for nonlinear Diophantine equations14
Ramsey goodness of k-uniform paths, or the lack thereof13
Reconstructing a generalized quadrangle from the Penttila–Williford 4-13
Quasi-random words and limits of word sequences13
Shult’s Haircut Theorem revised12
A broken circuit model for chromatic homology theories10
Bipartite Ramsey numbers of cycles8
A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors8
Set partitions, tableaux, and subspace profiles under regular diagonal matrices8
The Ehrhart and face polynomials of the graph polytope of a cycle8
Tighter bounds on the independence number of the Birkhoff graph7
A quadratic identity in the shuffle algebra and an alternative proof for de Bruijn’s formula7
A strengthening of the Erdős–Szekeres Theorem7
On the number of independent sets in uniform, regular, linear hypergraphs7
Tight bounds for Katona’s shadow intersection theorem7
The eternal game chromatic number of random graphs7
Extremal graphs of the pth power of paths7
A duality theorem for the ic-resurgence of edge ideals7
P-partition power sums6
A note on non-empty cross-intersecting families6
On some problems regarding distance-balanced graphs6
Some coefficient sequences related to the descent polynomial6
On Hankel determinants for Dyck paths with peaks avoiding multiple classes of heights6
Digraph redicolouring5
On tangencies among planar curves with an application to coloring L-shapes5
Special values of spectral zeta functions and combinatorics: Sturm–Liouville problems5
Extremal numbers of hypergraph suspensions of even cycles5
On non-degenerate Turán problems for expansions5
On the chromatic edge stability index of graphs5
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal5
Variations on a tree5
Full asymptotic expansion for orbit-summable quadrant walks and discrete polyharmonic functions5
Rainbow clique subdivisions5
Excedance-type polynomials, gamma-positivity and alternatingly increasing property5
On the enumeration of plane bipolar posets and transversal structures4
Editorial Board4
Strong edge coloring of circle graphs4
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment4
On the upward book thickness problem: Combinatorial and complexity results4
Sufficient connectivity conditions for rigidity of symmetric frameworks4
Homomorphisms to small negative even cycles4
A co-preLie structure from chronological loop erasure in graph walks4
On a conjecture of Grünbaum on longest cycles4
An improved linear connectivity bound for tournaments to be highly linked4
Combinatorics of a disordered two-species ASEP on a torus4
On regular set systems containing regular subsystems4
The Alon–Tarsi number of a toroidal grid4
Some non-existence results on m-ovoids in classical polar spaces4
Subdivisions in dicritical digraphs with large order or digirth4
Progressions in Euclidean Ramsey theory4
Universality vs Genericity and C4
Skew key polynomials and a generalized Littlewood–Richardson rule4
Hadwiger’s conjecture and topological bounds4
An algebraic approach for counting DP-3-colorings of sparse graphs4
Toric Richardson varieties of Catalan type and Wedderburn–Etherington numbers4
Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović4
Stable sets in flag spheres4
A deletion–contraction long exact sequence for chromatic symmetric homology4
Partial geometric designs arising from association schemes4
Degree conditions for Ramsey goodness of paths4
Spined categories: Generalizing tree-width beyond graphs4
Few distance sets in p4
The extensible No-Three-In-Line problem4
Two problems in graph Ramsey theory3
Best possible bounds on the number of distinct differences in intersecting families3
Corrigendum to “Orientably-regular maps of Euler characteristic 3
Distance matrices of a tree: Two more invariants, and in a unified framework3
Non-ambiguous trees: New results and generalisation3
Editorial Board3
On λ-fold relative Heffter arrays and biembedding multigraphs on surfa3
On ribbon graphs and virtual links3
Number of A+3
A note on the singularity probability of random directed d-regular gra3
10 problems for partitions of triangle-free graphs3
Packing and covering directed triangles asymptotically3
A characterization of positroids, with applications to amalgams and excluded minors3
Transport of patterns by Burge transpose3
Editorial Board3
Polynomials related to q-analog of the generalized derivative polynomi3
Principal specializations of Schubert polynomials and pattern containment3
On the critical values of Burr’s problem3
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation3
On balanceable and simply balanceable regular graphs3
Kempe changes in degenerate graphs3
Clique immersions and independence number3
Pendant appearances and components in random graphs from structured classes3
Coloring circle arrangements: New 4-chromatic planar graphs3
On the size of (K3
Shift-plethysm, hydra continued fractions, and m-distinct partitio3
Induced Turán problems and traces of hypergraphs2
Minimising the total number of subsets and supersets2
Quasi-transitive K2
Combinatorial generation via permutation languages. VI. Binary trees2
All 3-transitive groups satisfy the strict-Erdős–Ko–Rado property2
Delta-matroids whose twist polynomials are monomials2
Weak ascent sequences and related combinatorial structures2
On heroes in digraphs with forbidden induced forests2
Almost orthogonal subsets of vector spaces over finite fields2
Real stable polynomials and the alternatingly increasing property2
Editorial Board2
Editorial Board2
Zero sum cycles in complete digraphs2
Editorial Board2
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths2
On the number of tangencies among 1-intersecting x-monotone curves2
Editorial Board2
Corrigendum to “Some doubly transitive bilinear dual hyperovals and their ambient spaces” [European J. Combin. 44 (2015) 1–22]2
Permutation Tutte polynomial2
Chromatic quasisymmetric class functions for combinatorial Hopf monoids2
Cops and robbers on directed and undirected abelian Cayley graphs2
Hochschild lattices and shuffle lattices2
Maximizing five-cycles in Kr2
Representations of automorphism groups on the homology of matroids2
Partitioning a 2-edge-coloured graph of minimum degree 2n2
Graph polynomials and group coloring of graphs2
Graphs with large maximum degree containing no edge-critical graphs2
Asymptotics of local face distributions and the face distribution of the complete graph2
Bounds for the number of multidimensional partitions2
Diameter of the commutation classes graph of a permutation2
Minimum degree conditions for containing an r-regular 2
Decomposition horizons and a characterization of stable hereditary classes of graphs2
Rainbow connectivity and rainbow index of inhomogeneous random graphs2
Tree-width dichotomy2
Bollobás-type theorems for hemi-bundled two families2
The mixing time of switch Markov chains: A unified approach2
Enumeration of various animals on the triangular lattice2
Intersection density of transitive groups with small cyclic point stabilizers2
Polynomial bounds for chromatic number VI. Adding a four-vertex path2
Graph-codes2
Bijections for generalized Tamari intervals via orientations2
Settling the genus of the n-prism2
Congruences related to dual sequences and Catalan numbers2
On a faithful representation of Sturmian morphisms2
Max-norm Ramsey theory2
Editorial Board2
Extremal graphs without long paths and large cliques2
Properties of 8-contraction-critical graphs with no K2
The binomial-Stirling–Eulerian polynomials2
Bounding clique size in squares of planar graphs2
Bounded Dyck paths, bounded alternating sequences, orthogonal polynomials, and reciprocity2
Bi-eulerian embeddings of graphs and digraphs2
Editorial Board2
Preface2
Editorial Board2
Hamilton completion and the path cover number of sparse random graphs2
Macdonald polynomials and cyclic sieving2
On the order of semiregular automorphisms of cubic vertex-transitive graphs2
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property2
A simple (22
Problems close to my heart2
Deletion–contraction and the surface Tutte polynomial2
Rectangulotopes2
Preface2
Continuously increasing subsequences of random multiset permutations2
Cyclic coloring of plane graphs with maximum face size 16 and 172
0.077549934387207