European Journal of Combinatorics

Article	Citations
Coloring circle arrangements: New 4-chromatic planar graphs	47
Packing and covering directed triangles asymptotically	29
Pendant appearances and components in random graphs from structured classes	19
Toric Richardson varieties of Catalan type and Wedderburn–Etherington numbers	17
Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović	15
A quadratic identity in the shuffle algebra and an alternative proof for de Bruijn’s formula	14
Degree conditions for Ramsey goodness of paths	14
An algebraic approach for counting DP-3-colorings of sparse graphs	14
Skew key polynomials and a generalized Littlewood–Richardson rule	11
On Hankel determinants for Dyck paths with peaks avoiding multiple classes of heights	11
Subdivisions in dicritical digraphs with large order or digirth	10
A note on non-empty cross-intersecting families	9
An identity of Ramanujan and its combinatorics	9
On the size of (K	8
Rainbow clique subdivisions	8
Corrigendum to “Orientably-regular maps of Euler characteristic −	8
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation	8
Walks avoiding a quadrant and the reflection principle	8
A characterization of positroids, with applications to amalgams and excluded minors	8
A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors	8
The extensible No-Three-In-Line problem	7
Rainbow connectivity and rainbow index of inhomogeneous random graphs	7
Polynomial bounds for chromatic number VI. Adding a four-vertex path	7
The Alon–Tarsi number of a toroidal grid	7
Continuously increasing subsequences of random multiset permutations	7

On the maximum number of common neighbours in dense random regular graphs	7
Parity biases in partitions and restricted partitions	7
Clique immersions and independence number	7
Editorial Board	7
Clustered coloring of graphs with bounded layered treewidth and bounded degree	7
Rectangulotopes	7
A duality theorem for the ic-resurgence of edge ideals	7
Stability theorems for some Kruskal–Katona type results	6
Almost orthogonal subsets of vector spaces over finite fields	6
Precoloring extension in planar near-Eulerian-triangulations	6
Induced Turán problems and traces of hypergraphs	6
Editorial Board	6
On the restricted sumsets containing powers of an integer	6
Editorial Board	6
A new bound for the Maker–Breaker triangle game	6
Stanley–Wilf limits for patterns in rooted labeled forests	6
Quasiplanar graphs, string graphs, and the Erdős–Gallai problem	6
On sum-intersecting families of positive integers	5
Shape of the asymptotic maximum sum-free sets in integer lattice grids	5
Improved upper bound on the Frank number of 3-edge-connected graphs	5
Clique covers of H-free graphs	5
Fundamental quasisymmetric functions in superspace	5
The structure of large non-trivial t-intersecting families of finite s	5
Improved bounds for the dimension of divisibility	5
Minimum degree ensuring that a hypergraph is hamiltonian-connected	5
Transducing paths in graph classes with unbounded shrubdepth	5
Editorial Board	5
Stack and queue numbers of graphs revisited	4
List-recoloring of sparse graphs	4
Spanning hypertrees, vertex tours and meanders	4
When removing an independent set is optimal for reducing the chromatic number	4
When all directed cycles have length three	4
Induced subdivisions with pinned branch vertices	4
Coloring zonotopal quadrangulations of the projective space	4
Characterizations of families of morphisms and words via binomial complexities	4
On the spectrum and linear programming bound for hypergraphs	4
The bunkbed conjecture is not robust to generalisation	4
MSO undecidability for hereditary classes of unbounded clique-width	4
Symmetry and Pieri rules for the bisymmetric Macdonald polynomials	4
Distinguishing index of graphs with simple automorphism groups	4
P-strict promotion and 4
Intersection theorems for (	4
Guarding isometric subgraphs and cops and robber in planar graphs	4
Binomial determinants for tiling problems yield to the holonomic ansatz	4
Thresholds for constrained Ramsey and anti-Ramsey problems	4
Minors, connectivity, and diameter in randomly perturbed sparse graphs	4
Factor-of-iid balanced orientation of non-amenable graphs	4
Separating rank 3 graphs	4
Approximating fractionally isomorphic graphons	4
Finding strong components using depth-first search	4

Sum-distinguishing number of sparse hypergraphs	4
Dual Ramsey properties for classes of algebras	4
Crystal pop-stack sorting and type A crystal lattices	4
Hardness of the generalized coloring numbers	4
Comparing width parameters on graph classes	3
Wachs permutations, Bruhat order and weak order	3
Strong edge coloring of circle graphs	3
Some snarks are worse than others	3
Partial geometric designs arising from association schemes	3
On the Δ-edge stability number of graphs	3
Intersections and distinct intersections in cross-intersecting families	3
Ramsey goodness of k-uniform paths, or the lack thereof	3
The (k,l)<	3
On the order of semiregular automorphisms of cubic vertex-transitive graphs	3
Non-existence of two infinite families of strongly regular graphs	3
New necessary conditions for the existence of finite non-Desarguesian flag-transitive projective planes	3
Terrain-like graphs and the median Genocchi numbers	3
The rotation distance of brooms	3
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment	3
Partitioning the projective plane and the dunce hat	3
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics	3
Spanning subdivisions in dense digraphs	3
Enumeration of standard barely set-valued tableaux of shifted shapes	3
Generalized Turán problem for a path and a clique	3
Stable sets in flag spheres	3
Kempe changes in degenerate graphs	3
Editorial Board	3
The sum of all width-one matrices	3
Asymmetric edge-colorings of graphs with three colors	3
The semi-random tree process	3
On the cancellation-free antipode formula for the Malvenuto–Reutenauer Hopf Algebra	3
Editorial Board	3
Primitive elements of the Hopf algebras of tableaux	3
Kalai’s conjecture in r-partite 3
Almost unimodal and real-rooted graph polynomials	3
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal	3
High-dimensional expanders from Kac–Moody–Steinberg groups	3
On degree powers and counting stars in F-free graphs	3
When (signless) Laplacian coefficients meet matchings of subdivision	3
Parametric restrictions on quasi-symmetric designs	3
The Weighted Davenport constant of a group and a related extremal problem-II	2
The permuto-associahedron revisited	2
Two problems on subset sums	2
Giant rainbow trees in sparse random graphs	2
Large Y3,	2
Improved incidence bounds over arbitrary finite fields via the VC-dimension theory	2
Aldous’ spectral gap property for normal Cayley graphs on symmetric groups	2
Editorial Board	2
Quasi-random words and limits of word sequences	2
Counting deranged matchings	2
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths	2
Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph	2
Deformation cones of graph associahedra and nestohedra	2
Unimodality and certain bivariate formal Laurent series	2
Preface	2
Partitioning a 2-edge-coloured graph of minimum degree 2n	2
Building graphs with high minimum degree on a budget	2
Descents on nonnesting multipermutations	2
Editorial Board	2
Stability of extremal connected hypergraphs avoiding Berge-paths	2
Regular sequences and synchronized sequences in abstract numeration systems	2
The Terwilliger algebra of the halved n-cube from the viewpoint of it	2
Dense sumsets of Sidon sequences	2
The excluded minors for the intersection of bicircular and lattice path matroids	2
Improved bounds on the maximum diversity of intersecting families	2
Connected (K	2
Characteristic sets of matroids	2
Counting substructures and eigenvalues I: Triangles	2
Partition and Cohen–Macaulay extenders	2
Moderate deviations of triangle counts in the Erdős-Rényi random graph G	2
Minimally globally rigid graphs	2
Boundary rigidity of 3D CAT(0) cube complexes	2
Spined categories: Generalizing tree-width beyond graphs	2
Signed Mahonian polynomials on derangements in classical Weyl groups	2
Deletion–contraction and the surface Tutte polynomial	2
Maximizing five-cycles in Kr	2
Homomorphism complexes, reconfiguration, and homotopy for directed graphs	2
High dimensional expanders and coset geometries	2
Weak diameter coloring of graphs on surfaces	2
Online coloring of short intervals	2

Editorial Board	2
The spectral radius of graphs with no odd wheels	2
In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent	2
Meanders: A personal perspective to the memory of Pierre Rosenstiehl	2
Editorial Board	2
Editorial Board	2
Decomposing a triangle-free planar graph into a forest and a subcubic forest	2
Neighbourhood complexity of graphs of bounded twin-width	2
Constructing sparsest ℓ-hamiltonian saturated 2
A generalization of the Erdős-Birch theorem	2
The Frank number and nowhere-zero flows on graphs	2
Characterizing matroids whose bases form graphic delta-matroids	2
Zero sum cycles in complete digraphs	2
Generating functions for fixed points of the Mullineux map	2
Number of A+	2
Generalizing Körner’s graph entropy to graphons	2
Polynomials related to q-analog of the generalized derivative polynomi	2
Hamiltonicity in Cherry-quasirandom 3-graphs	2
Real stable polynomials and the alternatingly increasing property	2
Combinatorial interpretations of truncated series from the Jacobi triple product identity	2
The maximum number of cliques in graphs with prescribed order, circumference and minimum degree	2
Editorial Board	2
A polynomial upper bound for poset saturation	2
Minimum degree conditions for containing an r-regular	2
Ramsey numbers of cliques versus monotone paths	2
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole	2
Properly colored short cycles in edge-colored graphs	2
Vertex-weighted digraphs and freeness of arrangements between Shi and Ish	2
On k-neighborly reorientations of oriented matroids	2
On colourability of polygon visibility graphs	2