European Journal of Combinatorics

Article	Citations
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation	22
Pendant appearances and components in random graphs from structured classes	22
Skew key polynomials and a generalized Littlewood–Richardson rule	19
Subdivisions in dicritical digraphs with large order or digirth	15
An identity of Ramanujan and its combinatorics	15
On the size of (K	12
A note on non-empty cross-intersecting families	10
The extensible No-Three-In-Line problem	10
On minimal actions of countable groups	10
Toric Richardson varieties of Catalan type and Wedderburn–Etherington numbers	10
A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors	10
Coloring circle arrangements: New 4-chromatic planar graphs	9
Rainbow clique subdivisions	9
Walks avoiding a quadrant and the reflection principle	9
Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović	9
Degree conditions for Ramsey goodness of paths	9
Quasisymmetric Schur Q	8
On the C	8
Clique immersions and independence number	8
A characterization of positroids, with applications to amalgams and excluded minors	8
The Alon–Tarsi number of a toroidal grid	8
A new bound for the Maker–Breaker triangle game	7
Stability theorems for some Kruskal–Katona type results	7
A duality theorem for the ic-resurgence of edge ideals	7
On the maximum number of common neighbours in dense random regular graphs	7

Continuously increasing subsequences of random multiset permutations	7
Clustered coloring of graphs with bounded layered treewidth and bounded degree	7
An algebraic approach for counting DP-3-colorings of sparse graphs	7
Fundamental quasisymmetric functions in superspace	6
Induced Turán problems and traces of hypergraphs	6
Almost orthogonal subsets of vector spaces over finite fields	6
Polynomial bounds for chromatic number VI. Adding a four-vertex path	6
Editorial Board	6
Stanley–Wilf limits for patterns in rooted labeled forests	6
Editorial Board	6
Ramsey expansions of Λ-ultrametric spaces	6
Parity biases in partitions and restricted partitions	6
Perfect matroids over skew hyperfields	6
Editorial Board	6
Rainbow connectivity and rainbow index of inhomogeneous random graphs	6
Rectangulotopes	6
Improved upper bound on the Frank number of 3-edge-connected graphs	5
Quasiplanar graphs, string graphs, and the Erdős–Gallai problem	5
Minimum degree ensuring that a hypergraph is hamiltonian-connected	5
List strong and list normal edge-coloring of (sub)cubic graphs	5
On the restricted sumsets containing powers of an integer	5
Clique covers of H-free graphs	5
Guarding isometric subgraphs and cops and robber in planar graphs	5
Shape of the asymptotic maximum sum-free sets in integer lattice grids	5
Precoloring extension in planar near-Eulerian-triangulations	5
On sum-intersecting families of positive integers	5
Improved bounds for the dimension of divisibility	5
Coloring zonotopal quadrangulations of the projective space	5
Minors, connectivity, and diameter in randomly perturbed sparse graphs	4
Some snarks are worse than others	4
MSO undecidability for hereditary classes of unbounded clique-width	4
On the cancellation-free antipode formula for the Malvenuto–Reutenauer Hopf Algebra	4
Characterizations of families of morphisms and words via binomial complexities	4
Strong parity edge-colorings of graphs	4
When removing an independent set is optimal for reducing the chromatic number	4
P-strict promotion and 4
When all directed cycles have length three	4
Editorial Board	4
Stack and queue numbers of graphs revisited	4
Asymmetric edge-colorings of graphs with three colors	4
Factor-of-iid balanced orientation of non-amenable graphs	4
Symmetry and Pieri rules for the bisymmetric Macdonald polynomials	4
Generalized Ramsey numbers of cycles, paths, and hypergraphs	4
Dual Ramsey properties for classes of algebras	4
Editorial Board	4
Approximating fractionally isomorphic graphons	4
Transducing paths in graph classes with unbounded shrubdepth	4
Finding strong components using depth-first search	4
List-recoloring of sparse graphs	4
Partitioning the projective plane and the dunce hat	4

On the spectrum and linear programming bound for hypergraphs	4
Intersection theorems for (	4
Higher q-continued fractions	4
Induced subdivisions with pinned branch vertices	4
Partial-dual genus polynomial of graphs	4
Preface	4
Crystal pop-stack sorting and type A crystal lattices	4
Sum-distinguishing number of sparse hypergraphs	4
Odd-Ramsey numbers of complete bipartite graphs	4
Thresholds for constrained Ramsey and anti-Ramsey problems	3
The rotation distance of brooms	3
Separating rank 3 graphs	3
Finite Ramsey degrees and Fraïssé expansions with the Ramsey property	3
Wachs permutations, Bruhat order and weak order	3
The asymptotic uniform distribution of subset sums	3
Ramsey goodness of k-uniform paths, or the lack thereof	3
On the order of semiregular automorphisms of cubic vertex-transitive graphs	3
Fragile minor-monotone parameters under a random edge perturbation	3
Homotopy types of Hom complexes of graph homomorphisms whose codomains are square-free	3
Non-existence of two infinite families of strongly regular graphs	3
The sum of all width-one matrices	3
Enumeration of standard barely set-valued tableaux of shifted shapes	3
Spanning subdivisions in dense digraphs	3
The bunkbed conjecture is not robust to generalisation	3
Kalai’s conjecture in r-partite 3
Spanning hypertrees, vertex tours and meanders	3
The Erdős–Ko–Rado theorem in	3
Almost unimodal and real-rooted graph polynomials	3
Polynomials related to q-analog of the generalized derivative polynomi	3
The semi-random tree process	3
Kempe changes in degenerate graphs	3
Stable sets in flag spheres	3
Comparing width parameters on graph classes	3
The (k,l)<	3
Intersections and distinct intersections in cross-intersecting families	3
New necessary conditions for the existence of finite non-Desarguesian flag-transitive projective planes	3
A self-conjugate partition analog of	3
Hardness of the generalized coloring numbers	3
Generalized Turán problem for a path and a clique	3
Terrain-like graphs and the median Genocchi numbers	3
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment	3
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics	3
High-dimensional expanders from Kac–Moody–Steinberg groups	3
Editorial Board	3
Borel sets of Rado graphs and Ramsey’s theorem	3
Editorial Board	3
On the structures of subset sums in higher dimension	3
On the Δ-edge stability number of graphs	3
When (signless) Laplacian coefficients meet matchings of subdivision	3
Decomposing a triangle-free planar graph into a forest and a subcubic forest	2
Deletion–contraction and the surface Tutte polynomial	2
Beyond the pseudoforest strong Nine Dragon Tree Theorem	2
Critically intersecting hypergraphs	2
The Weighted Davenport constant of a group and a related extremal problem-II	2
Meanders: A personal perspective to the memory of Pierre Rosenstiehl	2
Partitioning a 2-edge-coloured graph of minimum degree 2n	2
A counterexample to the Ross–Yong conjecture for Grothendieck polynomials	2
Weak diameter coloring of graphs on surfaces	2
Strong edge coloring of circle graphs	2
Combinatorial interpretations of truncated series from the Jacobi triple product identity	2
Editorial Board	2
Editorial Board	2
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths	2
Erdős–Ko–Rado type results for partitions via spread approximations	2
Stability properties for subgroups generated by return words	2
On colourability of polygon visibility graphs	2
Note on a problem of Sárközy on multiplicative representation functions	2
Hamiltonicity in Cherry-quasirandom 3-graphs	2
In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent	2
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole	2
Counting deranged matchings	2
1-planar unit distance graphs	2
Large Y3,	2
Oriented expressions of graph properties	2
Constructing sparsest ℓ-hamiltonian saturated 2
The excluded minors for the intersection of bicircular and lattice path matroids	2
Stability of extremal connected hypergraphs avoiding Berge-paths	2
Giant rainbow trees in sparse random graphs	2
Vertex-weighted digraphs and freeness of arrangements between Shi and Ish	2
Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements	2

A polynomial upper bound for poset saturation	2
Aldous’ spectral gap property for normal Cayley graphs on symmetric groups	2
Maximizing the number of rational-value sums or zero-sums	2
Minimally globally rigid graphs	2
Editorial Board	2
Descents on nonnesting multipermutations	2
Partial geometric designs arising from association schemes	2
Unimodality and certain bivariate formal Laurent series	2
Editorial Board	2
A decomposition of cylindric partitions and cylindric partitions into distinct parts	2
Improved bounds on the maximum diversity of intersecting families	2
Preface	2
Generating functions for fixed points of the Mullineux map	2
Editorial Board	2
Characteristic sets of matroids	2
Homomorphism complexes, reconfiguration, and homotopy for directed graphs	2
Editorial Board	2
The permuto-associahedron revisited	2
Building graphs with high minimum degree on a budget	2
A new bijective proof of the q	2
Editorial Board	2
Minimum weight Euclidean (12
On k-neighborly reorientations of oriented matroids	2
Reconfiguration of vertex colouring and forbidden induced subgraphs	2
Dense sumsets of Sidon sequences	2
Neighbourhood complexity of graphs of bounded twin-width	2
Growth rates of permutations with given descent or peak set	2
Boundary rigidity of 3D CAT(0) cube complexes	2
On degree powers and counting stars in F-free graphs	2
Real stable polynomials and the alternatingly increasing property	2
Signed Mahonian polynomials on derangements in classical Weyl groups	2
Spined categories: Generalizing tree-width beyond graphs	2
Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph	2
Ramsey numbers of cliques versus monotone paths	2
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal	2
Minimum degree conditions for containing an r-regular	2
Improved incidence bounds over arbitrary finite fields via the VC-dimension theory	2
Majority bootstrap percolation on the permutahedron and other high-dimensional graphs	2
Generalized quasikernels in digraphs	2
Deformation cones of graph associahedra and nestohedra	2
Generalizing Körner’s graph entropy to graphons	2
High dimensional expanders and coset geometries	2
Reconfiguring homomorphisms to reflexive graphs via a simple reduction	2
The Frank number and nowhere-zero flows on graphs	2
The maximum number of cliques in graphs with prescribed order, circumference and minimum degree	2
A variant of the Erdős–Gyárfás problem for	2
Unions of intervals in codes based on powers of sets	2
On the maximum number of edges in hypergraphs with fixed matching and clique number	2
Online coloring of short intervals	2
Moderate deviations of triangle counts in the Erdős-Rényi random graph G	2
Partition and Cohen–Macaulay extenders	2
Corners and simpliciality in oriented matroids and partial cubes	1
Editorial Board	1
Combinatorial aspects of sandpile models on wheel and fan graphs	1
A bijection between Tamari intervals and extended fighting fish	1
Exact values and improved bounds on k-neighborly families of boxes	1
Some exact results for generalized Turán problems	1
On the minimum spanning tree distribution in grids	1
Graph sequences sampled from Robinson graphons	1
Variations on a tree	1
Generalized diagonals in positive semi-definite matrices	1
On positive hypergraphs	1
Normal 5-edge-coloring of some snarks superpositioned by Flower snarks	1
Decomposition of triangle-free planar graphs	1
The partial derivative of ratios of Schur polynomials and applications to symplectic quotients	1
Proof of a conjecture of Fomichev and Karev	1
A characterization of the Grassmann graphs: One missing case	1
Simple proofs for lattice coverings and sparse tensors	1
Biclique immersions in graphs with independence number 2	1
Rota’s basis conjecture holds for random bases of vector spaces	1
New upper bounds for Ramsey numbers of books	1
Representation functions avoiding integers with density zero	1
Full asymptotic expansion for orbit-summable quadrant walks and discrete polyharmonic functions	1
Renitent lines	1
Vertex-primitive s-arc-transitive digraphs admitting a Suzuki or Ree	1
VC-saturated set systems	1
Infinitely many minimally non-Ramsey size-linear graphs	1
Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents	1
Nearly extremal non-trivial crosst-intersecting families and	1
Optimally reconfiguring list and correspondence colourings	1
Generalized Erdős–Rogers problems for hypergraphs	1
t-sails and sparse hereditary classes of unbounded tree-width	1
A nonlinear bound for the number of subsequence sums	1
On convergence for graphexes	1
Decks of rooted binary trees	1
Theorems and conjectures on some rational generating functions	1
A consistent sandpile torsor algorithm for regular matroids	1
On naturally labelled posets and permutations avoiding 12–34	1
On balanceable and simply balanceable regular graphs	1
Coloring triangle-free L-graphs with O(	1
Saturation problems in convex geometric hypergraphs	1
The Nash-Williams orientation theorem for graphs with countably many ends	1
Injective edge colorings of degenerate graphs and the oriented chromatic number	1
Arcs in F	1
No additional tournaments are quasirandom-forcing	1