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	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
Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović	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	12
A quadratic identity in the shuffle algebra and an alternative proof for de Bruijn’s formula	10
Degree conditions for Ramsey goodness of paths	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
An identity of Ramanujan and its combinatorics	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
A duality theorem for the ic-resurgence of edge ideals	8
A note on non-empty cross-intersecting families	8
Walks avoiding a quadrant and the reflection principle	7
On the size of (K	7
Induced Turán problems and traces of hypergraphs	7
Corrigendum to “Orientably-regular maps of Euler characteristic −	7
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation	7
Editorial Board	7

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

Kempe changes in degenerate graphs	3
Partitioning the projective plane and the dunce hat	3
Editorial Board	3
New necessary conditions for the existence of finite non-Desarguesian flag-transitive projective planes	3
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics	3
On the Δ-edge stability number of graphs	3
On the order of semiregular automorphisms of cubic vertex-transitive graphs	3
Kalai’s conjecture in r-partite 3
Enumeration of standard barely set-valued tableaux of shifted shapes	3
Terrain-like graphs and the median Genocchi numbers	3
Improved bounds on the Ramsey number of fans	3
Minors, connectivity, and diameter in randomly perturbed sparse graphs	3
On the cancellation-free antipode formula for the Malvenuto–Reutenauer Hopf Algebra	3
Parametric restrictions on quasi-symmetric designs	3
The sum of all width-one matrices	3
Partial geometric designs arising from association schemes	3
Strong edge coloring of circle graphs	3
The semi-random tree process	3
Comparing width parameters on graph classes	3
Non-existence of two infinite families of strongly regular graphs	3
List-recoloring of sparse graphs	3
Spanning subdivisions in dense digraphs	3
The bunkbed conjecture is not robust to generalisation	3
MSO undecidability for hereditary classes of unbounded clique-width	3
Factor-of-iid balanced orientation of non-amenable graphs	3
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment	3
Binomial determinants for tiling problems yield to the holonomic ansatz	3
Generalized Turán problem for a path and a clique	3
Intersections and distinct intersections in cross-intersecting families	3
Editorial Board	3
The (k,l)<	3
Almost unimodal and real-rooted graph polynomials	3
When (signless) Laplacian coefficients meet matchings of subdivision	3
Wachs permutations, Bruhat order and weak order	3
On degree powers and counting stars in F-free graphs	2
Oriented expressions of graph properties	2
Spined categories: Generalizing tree-width beyond graphs	2
Large Y3,	2
High-dimensional expanders from Kac–Moody–Steinberg groups	2
The excluded minors for the intersection of bicircular and lattice path matroids	2
Unimodality and certain bivariate formal Laurent series	2
Online coloring of short intervals	2
Coloring graphs by translates in the circle	2
Aldous’ spectral gap property for normal Cayley graphs on symmetric groups	2
The Weighted Davenport constant of a group and a related extremal problem-II	2
Improved incidence bounds over arbitrary finite fields via the VC-dimension theory	2
Partitioning a 2-edge-coloured graph of minimum degree 2n	2
Homomorphism complexes, reconfiguration, and homotopy for directed graphs	2
Minimally globally rigid graphs	2
Deformation cones of graph associahedra and nestohedra	2
Generating functions for fixed points of the Mullineux map	2
In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent	2
The permuto-associahedron revisited	2
Neighbourhood complexity of graphs of bounded twin-width	2
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole	2
Editorial Board	2
Decomposing a triangle-free planar graph into a forest and a subcubic forest	2
Meanders: A personal perspective to the memory of Pierre Rosenstiehl	2
Characterizing matroids whose bases form graphic delta-matroids	2
Combinatorial interpretations of truncated series from the Jacobi triple product identity	2
Connected (K	2
Quasi-random words and limits of word sequences	2
Reconfiguration of vertex colouring and forbidden induced subgraphs	2
Number of A+	2
Dense sumsets of Sidon sequences	2
Editorial Board	2
Zero sum cycles in complete digraphs	2
Characteristic sets of matroids	2
Editorial Board	2
Maximizing five-cycles in Kr	2
Counting deranged matchings	2
Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph	2
Descents on nonnesting multipermutations	2
Real stable polynomials and the alternatingly increasing property	2
Weak diameter coloring of graphs on surfaces	2
Regular sequences and synchronized sequences in abstract numeration systems	2
Properly colored short cycles in edge-colored graphs	2
The Terwilliger algebra of the halved n-cube from the viewpoint of it	2
Waiter–Client triangle-factor game on the edges of the complete graph	2
Constructing sparsest ℓ-hamiltonian saturated 2

Generalizing Körner’s graph entropy to graphons	2
Deletion–contraction and the surface Tutte polynomial	2
High dimensional expanders and coset geometries	2
Two problems on subset sums	2
Vertex-weighted digraphs and freeness of arrangements between Shi and Ish	2
Minimum weight Euclidean (12
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal	2
Boundary rigidity of 3D CAT(0) cube complexes	2
Polynomials related to q-analog of the generalized derivative polynomi	2
Partition and Cohen–Macaulay extenders	2
On colourability of polygon visibility graphs	2
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths	2
The Frank number and nowhere-zero flows on graphs	2
Editorial Board	2
Minimum degree conditions for containing an r-regular	2
Signed Mahonian polynomials on derangements in classical Weyl groups	2
Stable sets in flag spheres	2
Ramsey numbers of cliques versus monotone paths	2
Editorial Board	2
The maximum number of cliques in graphs with prescribed order, circumference and minimum degree	2
The spectral radius of graphs with no odd wheels	2
Hamiltonicity in Cherry-quasirandom 3-graphs	2
Stability of extremal connected hypergraphs avoiding Berge-paths	2
Splitting subspaces and a finite field interpretation of the Touchard–Riordan Formula	2
On k-neighborly reorientations of oriented matroids	2
Improved bounds on the maximum diversity of intersecting families	2
On the maximum number of edges in hypergraphs with fixed matching and clique number	2
Distinct distances in R	1
Coloring triangle-free L-graphs with O(	1
Macdonald polynomials and cyclic sieving	1
Ball packings for links	1
Some exact results for generalized Turán problems	1
All 3-transitive groups satisfy the strict-Erdős–Ko–Rado property	1
Combinatorics of a disordered two-species ASEP on a torus	1
A bijection between Tamari intervals and extended fighting fish	1
Group coloring and group connectivity with non-isomorphic groups of the same order	1
Cubic factor-invariant graphs of cycle quotient type—The alternating case	1
On bipartite graphs with exactly one irreducible T-module with endpo	1
A refinement of Cauchy–Schwarz complexity	1
Nearly extremal non-trivial crosst-intersecting families and	1
VC-saturated set systems	1
Arcs in F	1
Bijective link between Chapoton’s new intervals and bipartite planar maps	1
Maximal edge colorings of graphs	1
On naturally labelled posets and permutations avoiding 12–34	1
Quasigraphs and skeletal partitions	1
Overpartition analogues for the generalized Rogers–Ramanujan identities of Bressoud	1
A nonlinear bound for the number of subsequence sums	1
Rota’s basis conjecture holds for random bases of vector spaces	1
Infinitely many minimally non-Ramsey size-linear graphs	1
4-connected polyhedra have at least a linear number of hamiltonian cycles	1
A consistent sandpile torsor algorithm for regular matroids	1
On positive hypergraphs	1
Editorial Board	1
Hadwiger’s conjecture and topological bounds	1
t-sails and sparse hereditary classes of unbounded tree-width	1
The planar Cayley graphs are effectively enumerable II	1
Editorial Board	1
Graphical regular representations of (2,	1
On the enumeration of plane bipolar posets and transversal structures	1
The Nash-Williams orientation theorem for graphs with countably many ends	1
1/2-conjecture	1
Vertex-primitive s-arc-transitive digraphs admitting a Suzuki or Ree	1
An improved condition for a graph to be determined by its generalized spectrum	1
Orientably-regular maps of Euler characteristic −2	1
Cutoff on graphs and the Sarnak–Xue density of eigenvalues	1
Decks of rooted binary trees	1
Renitent lines	1
New upper bounds for Ramsey numbers of books	1
Localized versions of extremal problems	1
Exact values and improved bounds on k-neighborly families of boxes	1
On convergence for graphexes	1
On generalized quadrangles with a group of automorphisms acting regularly on the point set, difference sets with	1
Edge colorings avoiding patterns	1
On the connectivity and diameter of geodetic graphs	1
On a conjecture of Gross, Mansour and Tucker	1
Preface	1
On the upward book thickness problem: Combinatorial and complexity results	1
Theorems and conjectures on some rational generating functions	1
Combinatorial aspects of sandpile models on wheel and fan graphs	1
A note on the uniformity threshold for Berge hypergraphs	1
Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents	1
Injective edge colorings of degenerate graphs and the oriented chromatic number	1
Schröder combinatorics and ν-associahedra	1
Extremal problems for intersecting families of subspaces with a measure	1
A local characterization of quasi-crystal graphs	1
On the chromatic number of the preferential attachment graph	1
Normal 5-edge-coloring of some snarks superpositioned by Flower snarks	1
Saturation problems in convex geometric hypergraphs	1
A new upper bound for the Ramsey number of fans	1
Representation functions avoiding integers with density zero	1
(−	1
On incidences of lines in regular complexes	1
Biclique immersions in graphs with independence number 2	1
Graph sequences sampled from Robinson graphons	1