European Journal of Combinatorics

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

Rainbow connectivity and rainbow index of inhomogeneous random graphs	6
Stability theorems for some Kruskal–Katona type results	6
Editorial Board	6
Editorial Board	6
Rectangulotopes	6
Almost orthogonal subsets of vector spaces over finite fields	6
Induced Turán problems and traces of hypergraphs	6
On the maximum number of common neighbours in dense random regular graphs	6
A new bound for the Maker–Breaker triangle game	6
Parity biases in partitions and restricted partitions	5
On the restricted sumsets containing powers of an integer	5
Fundamental quasisymmetric functions in superspace	5
Clustered coloring of graphs with bounded layered treewidth and bounded degree	5
Editorial Board	5
Minimum degree ensuring that a hypergraph is hamiltonian-connected	5
Improved bounds for the dimension of divisibility	5
Polynomial bounds for chromatic number VI. Adding a four-vertex path	5
Improved upper bound on the Frank number of 3-edge-connected graphs	5
Shape of the asymptotic maximum sum-free sets in integer lattice grids	5
Stanley–Wilf limits for patterns in rooted labeled forests	5
Distinguishing index of graphs with simple automorphism groups	4
Editorial Board	4
Reprint of: Precoloring extension in planar near-Eulerian-triangulations	4
Quasiplanar graphs, string graphs, and the Erdős–Gallai problem	4
Hardness of the generalized coloring numbers	4
Symmetry and Pieri rules for the bisymmetric Macdonald polynomials	4
P-strict promotion and 4
Sum-distinguishing number of sparse hypergraphs	4
Crystal pop-stack sorting and type A crystal lattices	4
Characterizations of families of morphisms and words via binomial complexities	4
When removing an independent set is optimal for reducing the chromatic number	4
On sum-intersecting families of positive integers	4
Transducing paths in graph classes with unbounded shrubdepth	4
Dual Ramsey properties for classes of algebras	4
Some snarks are worse than others	4
On the spectrum and linear programming bound for hypergraphs	4
Finding strong components using depth-first search	4
Induced subdivisions with pinned branch vertices	4
Guarding isometric subgraphs and cops and robber in planar graphs	4
Clique covers of H-free graphs	4
The structure of large non-trivial t-intersecting families of finite s	4
Coloring zonotopal quadrangulations of the projective space	4
Choosing between incompatible ideals	4
When all directed cycles have length three	4
Intersection theorems for (	4
Approximating fractionally isomorphic graphons	4
Primitive elements of the Hopf algebras of tableaux	3
Terrain-like graphs and the median Genocchi numbers	3
The rotation distance of brooms	3
Non-existence of two infinite families of strongly regular graphs	3

Wachs permutations, Bruhat order and weak order	3
Kalai’s conjecture in r-partite 3
Binomial determinants for tiling problems yield to the holonomic ansatz	3
Asymmetric edge-colorings of graphs with three colors	3
Comparing width parameters on graph classes	3
Partitioning the projective plane and the dunce hat	3
Enumeration of standard barely set-valued tableaux of shifted shapes	3
Almost unimodal and real-rooted graph polynomials	3
Separating rank 3 graphs	3
On the cancellation-free antipode formula for the Malvenuto–Reutenauer Hopf Algebra	3
Spanning subdivisions in dense digraphs	3
Generalized Turán problem for a path and a clique	3
Minors, connectivity, and diameter in randomly perturbed sparse graphs	3
Editorial Board	3
Thresholds for constrained Ramsey and anti-Ramsey problems	3
Improved bounds on the Ramsey number of fans	3
New necessary conditions for the existence of finite non-Desarguesian flag-transitive projective planes	3
Factor-of-iid balanced orientation of non-amenable graphs	3
When (signless) Laplacian coefficients meet matchings of subdivision	3
Spanning hypertrees, vertex tours and meanders	3
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics	3
On the Δ-edge stability number of graphs	3
The (k,l)<	3
List-recoloring of sparse graphs	3
MSO undecidability for hereditary classes of unbounded clique-width	3
Parametric restrictions on quasi-symmetric designs	3
Stack and queue numbers of graphs revisited	3
The sum of all width-one matrices	3
Zero sum cycles in complete digraphs	2
The spectral radius of graphs with no odd wheels	2
Dense sumsets of Sidon sequences	2
Editorial Board	2
Strong edge coloring of circle graphs	2
Weak diameter coloring of graphs on surfaces	2
Polynomials related to q-analog of the generalized derivative polynomi	2
Decomposing a triangle-free planar graph into a forest and a subcubic forest	2
Spined categories: Generalizing tree-width beyond graphs	2
Constructing sparsest ℓ-hamiltonian saturated 2
Ramsey goodness of k-uniform paths, or the lack thereof	2
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole	2
The permuto-associahedron revisited	2
Editorial Board	2
Real stable polynomials and the alternatingly increasing property	2
Vertex-weighted digraphs and freeness of arrangements between Shi and Ish	2
Minimum degree conditions for containing an r-regular	2
Hamiltonicity in Cherry-quasirandom 3-graphs	2
Partition and Cohen–Macaulay extenders	2
Building graphs with high minimum degree on a budget	2
Online coloring of short intervals	2
Homomorphism complexes, reconfiguration, and homotopy for directed graphs	2
Coloring graphs by translates in the circle	2
Waiter–Client triangle-factor game on the edges of the complete graph	2
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment	2
Generalizing Körner’s graph entropy to graphons	2
Intersections and distinct intersections in cross-intersecting families	2
Signed Mahonian polynomials on derangements in classical Weyl groups	2
Editorial Board	2
Counting deranged matchings	2
The semi-random tree process	2
Minimally globally rigid graphs	2
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal	2
The Terwilliger algebra of the halved n-cube from the viewpoint of it	2
On degree powers and counting stars in F-free graphs	2
A polynomial upper bound for poset saturation	2
Improved incidence bounds over arbitrary finite fields via the VC-dimension theory	2
Maximizing five-cycles in Kr	2
Quasi-random words and limits of word sequences	2
Aldous’ spectral gap property for normal Cayley graphs on symmetric groups	2
The maximum number of cliques in graphs with prescribed order, circumference and minimum degree	2
Characteristic sets of matroids	2
Deformation cones of graph associahedra and nestohedra	2
The Frank number and nowhere-zero flows on graphs	2
Properly colored short cycles in edge-colored graphs	2
High dimensional expanders and coset geometries	2
Boundary rigidity of 3D CAT(0) cube complexes	2
Number of A+	2
Meanders: A personal perspective to the memory of Pierre Rosenstiehl	2
Partial geometric designs arising from association schemes	2
Preface	2
Stable sets in flag spheres	2

Improved bounds on the maximum diversity of intersecting families	2
On the order of semiregular automorphisms of cubic vertex-transitive graphs	2
Large Y3,	2
High-dimensional expanders from Kac–Moody–Steinberg groups	2
On k-neighborly reorientations of oriented matroids	2
Kempe changes in degenerate graphs	2
Editorial Board	2
Partitioning a 2-edge-coloured graph of minimum degree 2n	2
Descents on nonnesting multipermutations	2
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths	2
Stability of extremal connected hypergraphs avoiding Berge-paths	2
Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph	2
Ramsey numbers of cliques versus monotone paths	2
The Weighted Davenport constant of a group and a related extremal problem-II	2
In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent	2
Deletion–contraction and the surface Tutte polynomial	2
On colourability of polygon visibility graphs	2