European Journal of Combinatorics

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

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

Intersection theorems for (	4
When (signless) Laplacian coefficients meet matchings of subdivision	3
MSO undecidability for hereditary classes of unbounded clique-width	3
Stack and queue numbers of graphs revisited	3
Primitive elements of the Hopf algebras of tableaux	3
On the cancellation-free antipode formula for the Malvenuto–Reutenauer Hopf Algebra	3
Wachs permutations, Bruhat order and weak order	3
Editorial Board	3
The sum of all width-one matrices	3
Terrain-like graphs and the median Genocchi numbers	3
Binomial determinants for tiling problems yield to the holonomic ansatz	3
Asymmetric edge-colorings of graphs with three colors	3
Factor-of-iid balanced orientation of non-amenable graphs	3
Separating rank 3 graphs	3
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics	3
The (k,l)<	3
Almost unimodal and real-rooted graph polynomials	3
Enumeration of standard barely set-valued tableaux of shifted shapes	3
New necessary conditions for the existence of finite non-Desarguesian flag-transitive projective planes	3
Thresholds for constrained Ramsey and anti-Ramsey problems	3
Improved bounds on the Ramsey number of fans	3
Partitioning the projective plane and the dunce hat	3
Minors, connectivity, and diameter in randomly perturbed sparse graphs	3
Parametric restrictions on quasi-symmetric designs	3
Spanning subdivisions in dense digraphs	3
Kalai’s conjecture in r-partite 3
Non-existence of two infinite families of strongly regular graphs	3
Maximizing five-cycles in Kr	2
The permuto-associahedron revisited	2
Ramsey goodness of k-uniform paths, or the lack thereof	2
Characteristic sets of matroids	2
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal	2
Hamiltonicity in Cherry-quasirandom 3-graphs	2
High dimensional expanders and coset geometries	2
Counting deranged matchings	2
Editorial Board	2
Partitioning a 2-edge-coloured graph of minimum degree 2n	2
On k-neighborly reorientations of oriented matroids	2
Deletion–contraction and the surface Tutte polynomial	2
Improved incidence bounds over arbitrary finite fields via the VC-dimension theory	2
Kempe changes in degenerate graphs	2
Online coloring of short intervals	2
Stable sets in flag spheres	2
Coloring graphs by translates in the circle	2
Partial geometric designs arising from association schemes	2
Intersections and distinct intersections in cross-intersecting families	2
Partition and Cohen–Macaulay extenders	2
Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph	2
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole	2
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment	2
On degree powers and counting stars in F-free graphs	2
Ramsey numbers of cliques versus monotone paths	2
Zero sum cycles in complete digraphs	2
Homomorphism complexes, reconfiguration, and homotopy for directed graphs	2
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths	2
Weak diameter coloring of graphs on surfaces	2
Editorial Board	2
Minimum degree conditions for containing an r-regular	2
The Terwilliger algebra of the halved n-cube from the viewpoint of it	2
Spined categories: Generalizing tree-width beyond graphs	2
Minimally globally rigid graphs	2
High-dimensional expanders from Kac–Moody–Steinberg groups	2
The Frank number and nowhere-zero flows on graphs	2
Editorial Board	2
A general incidence bound in R	2
Vertex-weighted digraphs and freeness of arrangements between Shi and Ish	2
Comparing width parameters on graph classes	2
Meanders: A personal perspective to the memory of Pierre Rosenstiehl	2
On the order of semiregular automorphisms of cubic vertex-transitive graphs	2
Decomposing a triangle-free planar graph into a forest and a subcubic forest	2
Polynomials related to q-analog of the generalized derivative polynomi	2
The Weighted Davenport constant of a group and a related extremal problem-II	2
Number of A+	2
The maximum number of cliques in graphs with prescribed order, circumference and minimum degree	2
Real stable polynomials and the alternatingly increasing property	2
Signed Mahonian polynomials on derangements in classical Weyl groups	2
Aldous’ spectral gap property for normal Cayley graphs on symmetric groups	2
Descents on nonnesting multipermutations	2
A polynomial upper bound for poset saturation	2
Quasi-random words and limits of word sequences	2

Constructing sparsest ℓ-hamiltonian saturated 2
On the Δ-edge stability number of graphs	2
Large Y3,	2
The semi-random tree process	2
Improved bounds on the maximum diversity of intersecting families	2
Strong edge coloring of circle graphs	2
A billiards-like dynamical system for attacking chess pieces	2
Dense sumsets of Sidon sequences	2
Generalized Turán problem for a path and a clique	2
Stability of extremal connected hypergraphs avoiding Berge-paths	2
The Burge correspondence and crystal graphs	1
Extensions of transversal valuated matroids	1
On bipartite graphs with exactly one irreducible T-module with endpo	1
Pebble exchange group of graphs	1
New truncated theorems for three classical theta function identities	1
Representation functions avoiding integers with density zero	1
No additional tournaments are quasirandom-forcing	1
Properly colored short cycles in edge-colored graphs	1
On a conjecture of Gross, Mansour and Tucker	1
A new lower bound for deterministic pop-stack-sorting	1
Waiter–Client triangle-factor game on the edges of the complete graph	1
A bijection between Tamari intervals and extended fighting fish	1
Editorial Board	1
Generalizing Körner’s graph entropy to graphons	1
Some exact results for generalized Turán problems	1
Hamilton completion and the path cover number of sparse random graphs	1
Long path and cycle decompositions of even hypercubes	1
4-connected polyhedra have at least a linear number of hamiltonian cycles	1
Reconfiguration of vertex colouring and forbidden induced subgraphs	1
On convergence for graphexes	1
Injective edge colorings of degenerate graphs and the oriented chromatic number	1
Oriented expressions of graph properties	1
Group coloring and group connectivity with non-isomorphic groups of the same order	1
Affine transitions for involution Stanley symmetric functions	1
Connected (K	1
Coloring triangle-free L-graphs with O(	1
Edge connectivity of simplicial polytopes	1
Modularity of some distance graphs	1
Orientably-regular maps of Euler characteristic −2	1
On balanced automorphisms of abelian groups	1
Nearly extremal non-trivial crosst-intersecting families and	1
Tree-width dichotomy	1
On naturally labelled posets and permutations avoiding 12–34	1
A refinement of Cauchy–Schwarz complexity	1
Overpartition analogues for the generalized Rogers–Ramanujan identities of Bressoud	1
Globally balancing spanning trees	1
Editorial Board	1
Simple proofs for lattice coverings and sparse tensors	1
Symmetries of voltage operations on polytopes, maps and maniplexes	1
Regular sequences and synchronized sequences in abstract numeration systems	1
Schröder combinatorics and ν-associahedra	1
On the maximum mean subtree order of trees	1
Neighbourhood complexity of graphs of bounded twin-width	1
On positive hypergraphs	1
Partial duality for ribbon graphs, II: Partial-twuality polynomials and monodromy computations	1
Editorial Board	1
On the chromatic number of the preferential attachment graph	1
Characterizing matroids whose bases form graphic delta-matroids	1
Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents	1
On hypergraph Turán problems with bounded matching number	1
Flows of 3-edge-colorable cubic signed graphs	1
(−	1
Optimally reconfiguring list and correspondence colourings	1
Minimum weight Euclidean (11
Arcs in F	1
Realizable cycle structures in digraphs	1
Extremal graphs without long paths and large cliques	1
Small rainbow cliques in randomly perturbed dense graphs	1
Vertex-primitive s-arc-transitive digraphs admitting a Suzuki or Ree	1
Turán numbers for hypergraph star forests	1
Renitent lines	1
Corners and simpliciality in oriented matroids and partial cubes	1
In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent	1
Graph sequences sampled from Robinson graphons	1
Hereditary classes of ordered sets of width at most two	1
On colourability of polygon visibility graphs	1
On incidences of lines in regular complexes	1
Normal 5-edge-coloring of some snarks superpositioned by Flower snarks	1
Boundary rigidity of 3D CAT(0) cube complexes	1
Theorems and conjectures on some rational generating functions	1
1/2-conjecture	1
The spectral radius of graphs with no odd wheels	1
Edge colorings avoiding patterns	1
The excluded minors for the intersection of bicircular and lattice path matroids	1
On the maximum number of edges in hypergraphs with fixed matching and clique number	1
Rota’s basis conjecture holds for random bases of vector spaces	1
Editorial Board	1
Two problems on subset sums	1
The Nash-Williams orientation theorem for graphs with countably many ends	1
Localized versions of extremal problems	1
Counting substructures and eigenvalues I: Triangles	1
Settling the genus of the n-prism	1
Hamiltonicity of Schrijver graphs and stable Kneser graphs	1
Splitting subspaces and a finite field interpretation of the Touchard–Riordan Formula	1
t-sails and sparse hereditary classes of unbounded tree-width	1