European Journal of Combinatorics

Article	Citations
Some exact results of the generalized Turán numbers for paths	38
Walks avoiding a quadrant and the reflection principle	34
Saturation numbers for Berge cliques	27
On Helly numbers of exponential lattices	20
An identity of Ramanujan and its combinatorics	14
On Rado conditions for nonlinear Diophantine equations	14
Reconstructing a generalized quadrangle from the Penttila–Williford 4-	13
Quasi-random words and limits of word sequences	13
Ramsey goodness of k-uniform paths, or the lack thereof	13
Shult’s Haircut Theorem revised	12
A broken circuit model for chromatic homology theories	10
A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors	8
Set partitions, tableaux, and subspace profiles under regular diagonal matrices	8
The Ehrhart and face polynomials of the graph polytope of a cycle	8
Bipartite Ramsey numbers of cycles	8
Tight bounds for Katona’s shadow intersection theorem	7
The eternal game chromatic number of random graphs	7
Extremal graphs of the pth power of paths	7
A duality theorem for the ic-resurgence of edge ideals	7
Tighter bounds on the independence number of the Birkhoff graph	7
A quadratic identity in the shuffle algebra and an alternative proof for de Bruijn’s formula	7
A strengthening of the Erdős–Szekeres Theorem	7
On the number of independent sets in uniform, regular, linear hypergraphs	7
On some problems regarding distance-balanced graphs	6
Some coefficient sequences related to the descent polynomial	6

On Hankel determinants for Dyck paths with peaks avoiding multiple classes of heights	6
P-partition power sums	6
A note on non-empty cross-intersecting families	6
On non-degenerate Turán problems for expansions	5
On the chromatic edge stability index of graphs	5
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal	5
Variations on a tree	5
Full asymptotic expansion for orbit-summable quadrant walks and discrete polyharmonic functions	5
Rainbow clique subdivisions	5
Excedance-type polynomials, gamma-positivity and alternatingly increasing property	5
Digraph redicolouring	5
On tangencies among planar curves with an application to coloring L-shapes	5
Special values of spectral zeta functions and combinatorics: Sturm–Liouville problems	5
Extremal numbers of hypergraph suspensions of even cycles	5
On regular set systems containing regular subsystems	4
The Alon–Tarsi number of a toroidal grid	4
Some non-existence results on m-ovoids in classical polar spaces	4
Subdivisions in dicritical digraphs with large order or digirth	4
Progressions in Euclidean Ramsey theory	4
Universality vs Genericity and C	4
Skew key polynomials and a generalized Littlewood–Richardson rule	4
Hadwiger’s conjecture and topological bounds	4
An algebraic approach for counting DP-3-colorings of sparse graphs	4
Toric Richardson varieties of Catalan type and Wedderburn–Etherington numbers	4
Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović	4
Stable sets in flag spheres	4
A deletion–contraction long exact sequence for chromatic symmetric homology	4
Partial geometric designs arising from association schemes	4
Degree conditions for Ramsey goodness of paths	4
Spined categories: Generalizing tree-width beyond graphs	4
Few distance sets in ℓp	4
The extensible No-Three-In-Line problem	4
On the enumeration of plane bipolar posets and transversal structures	4
Editorial Board	4
Strong edge coloring of circle graphs	4
Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment	4
On the upward book thickness problem: Combinatorial and complexity results	4
Sufficient connectivity conditions for rigidity of symmetric frameworks	4
Homomorphisms to small negative even cycles	4
A co-preLie structure from chronological loop erasure in graph walks	4
On a conjecture of Grünbaum on longest cycles	4
An improved linear connectivity bound for tournaments to be highly linked	4
Combinatorics of a disordered two-species ASEP on a torus	4
10 problems for partitions of triangle-free graphs	3
Editorial Board	3
Packing and covering directed triangles asymptotically	3
Principal specializations of Schubert polynomials and pattern containment	3
A characterization of positroids, with applications to amalgams and excluded minors	3
Transport of patterns by Burge transpose	3
Polynomials related to q-analog of the generalized derivative polynomi	3

On the critical values of Burr’s problem	3
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation	3
On balanceable and simply balanceable regular graphs	3
Coloring circle arrangements: New 4-chromatic planar graphs	3
Kempe changes in degenerate graphs	3
Shift-plethysm, hydra continued fractions, and m-distinct partitio	3
Clique immersions and independence number	3
Pendant appearances and components in random graphs from structured classes	3
On the size of (K	3
Two problems in graph Ramsey theory	3
Best possible bounds on the number of distinct differences in intersecting families	3
Corrigendum to “Orientably-regular maps of Euler characteristic −	3
On λ-fold relative Heffter arrays and biembedding multigraphs on surfa	3
Distance matrices of a tree: Two more invariants, and in a unified framework	3
Number of A+	3
Non-ambiguous trees: New results and generalisation	3
Editorial Board	3
On ribbon graphs and virtual links	3
A note on the singularity probability of random directed d-regular gra	3
Intersection density of transitive groups with small cyclic point stabilizers	2
Polynomial bounds for chromatic number VI. Adding a four-vertex path	2
Graph-codes	2
Bijections for generalized Tamari intervals via orientations	2
Settling the genus of the n-prism	2
Congruences related to dual sequences and Catalan numbers	2
On a faithful representation of Sturmian morphisms	2
Max-norm Ramsey theory	2
Editorial Board	2
Extremal graphs without long paths and large cliques	2
Properties of 8-contraction-critical graphs with no K	2
The binomial-Stirling–Eulerian polynomials	2
Bounding clique size in squares of planar graphs	2
Bounded Dyck paths, bounded alternating sequences, orthogonal polynomials, and reciprocity	2
Bi-eulerian embeddings of graphs and digraphs	2
Editorial Board	2
Preface	2
Editorial Board	2
Hamilton completion and the path cover number of sparse random graphs	2
Macdonald polynomials and cyclic sieving	2
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property	2
On the order of semiregular automorphisms of cubic vertex-transitive graphs	2
A simple (2	2
Problems close to my heart	2
Deletion–contraction and the surface Tutte polynomial	2
Rectangulotopes	2
Preface	2
Continuously increasing subsequences of random multiset permutations	2
Cyclic coloring of plane graphs with maximum face size 16 and 17	2
Induced Turán problems and traces of hypergraphs	2
Minimising the total number of subsets and supersets	2
Quasi-transitive K∞	2
Combinatorial generation via permutation languages. VI. Binary trees	2
All 3-transitive groups satisfy the strict-Erdős–Ko–Rado property	2
Delta-matroids whose twist polynomials are monomials	2
Weak ascent sequences and related combinatorial structures	2
On heroes in digraphs with forbidden induced forests	2
Almost orthogonal subsets of vector spaces over finite fields	2
Real stable polynomials and the alternatingly increasing property	2
Editorial Board	2
Editorial Board	2
Editorial Board	2
Zero sum cycles in complete digraphs	2
Testing the planar straight-line realizability of 2-trees with prescribed edge lengths	2
On the number of tangencies among 1-intersecting x-monotone curves	2
Editorial Board	2
Corrigendum to “Some doubly transitive bilinear dual hyperovals and their ambient spaces” [European J. Combin. 44 (2015) 1–22]	2
Permutation Tutte polynomial	2
Chromatic quasisymmetric class functions for combinatorial Hopf monoids	2
Cops and robbers on directed and undirected abelian Cayley graphs	2
Hochschild lattices and shuffle lattices	2
Maximizing five-cycles in Kr	2
Representations of automorphism groups on the homology of matroids	2
Partitioning a 2-edge-coloured graph of minimum degree 2n	2
Graph polynomials and group coloring of graphs	2
Graphs with large maximum degree containing no edge-critical graphs	2
Asymptotics of local face distributions and the face distribution of the complete graph	2
Bounds for the number of multidimensional partitions	2
Diameter of the commutation classes graph of a permutation	2
Minimum degree conditions for containing an r-regular	2
Decomposition horizons and a characterization of stable hereditary classes of graphs	2

Rainbow connectivity and rainbow index of inhomogeneous random graphs	2
Tree-width dichotomy	2
Bollobás-type theorems for hemi-bundled two families	2
Enumeration of various animals on the triangular lattice	2
The mixing time of switch Markov chains: A unified approach	2
Mixing is hard for triangle-free reflexive graphs	1
Shape of the asymptotic maximum sum-free sets in integer lattice grids	1
Edge connectivity of simplicial polytopes	1
A few words about maps	1
1/2-conjecture	1
New bounds on the maximum number of neighborly boxes in	1
Weak saturation stability	1
Poset modules of the 0-Hecke algebras and related quasisymmetric power sum expansions	1
Cubic factor-invariant graphs of cycle quotient type—The alternating case	1
Dense sumsets of Sidon sequences	1
The planar Cayley graphs are effectively enumerable II	1
Constructing sparsest ℓ-hamiltonian saturated 1
Structure of a sequence with prescribed zero-sum subsequences: Rank two p	1
A generalization of diversity for intersecting families	1
The Weighted Davenport constant of a group and a related extremal problem-II	1
Variations on the Bollobás set-pair theorem	1
Hamiltonicity of Schrijver graphs and stable Kneser graphs	1
Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs	1
Turán numbers for hypergraph star forests	1
Large Y3,	1
Short proof of a theorem of Brylawski on the coefficients of the Tutte polynomial	1
On some combinatorial sequences associated to invariant theory	1
Corners and simpliciality in oriented matroids and partial cubes	1
On regular systems of finite classical polar spaces	1
On bipartite graphs with exactly one irreducible T-module with endpo	1
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole	1
Parity biases in partitions and restricted partitions	1
Bounds on expected propagation time of probabilistic zero forcing	1
Block number, descents and Schur positivity of fully commutative elements in	1
Discrete Helly-type theorems for pseudohalfplanes	1
Metric dimension of critical Galton–Watson trees and linear preferential attachment trees	1
Distance–transitive digraphs: Descendant-homogeneity, propertyZand re	1
Stanley–Wilf limits for patterns in rooted labeled forests	1
The permuto-associahedron revisited	1
The structure of large non-trivial t-intersecting families of finite s	1
Stability theorems for some Kruskal–Katona type results	1
A point-conic incidence bound and applications over 1
High dimensional expanders and coset geometries	1
Affine transitions for involution Stanley symmetric functions	1
Aldous’ spectral gap property for normal Cayley graphs on symmetric groups	1
Prime vertex-minors of a prime graph	1
Periodic P-partitions	1
On an approach for evaluating certain trigonometric character sums using the discrete time heat kernel	1
Improved bounds for the dimension of divisibility	1
On the chromatic number of two generalized Kneser graphs	1
Editorial Board	1
Improved bounds on the maximum diversity of intersecting families	1
The irregularity strength of dense graphs — on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel	1
Near classification of compact hyperbolic Coxeter d-polytopes with <	1
Two Ramsey problems in blowups of graphs	1
A proof of the 3/5-conjecture in the domination game	1
Linear extensions and continued fractions	1
Arc-disjoint out- and in-branchings in compositions of digraphs	1
Threshold Ramsey multiplicity for paths and even cycles	1
Counterexamples to the interpolating conjecture on partial-dual genus polynomials of ribbon graphs	1
Decomposing a triangle-free planar graph into a forest and a subcubic forest	1
On the bipartiteness constant and expansion of Cayley graphs	1
Coloring graphs by translates in the circle	1
Composition closed premodel structures and the Kreweras lattice	1
Tournaments and the strong Erdős–Hajnal Property	1
On sumsets of nonbases of maximum size	1
On the chromatic vertex stability number of graphs	1
Modularity of some distance graphs	1
The Terwilliger algebra of the halved n-cube from the viewpoint of it	1
Minimally globally rigid graphs	1
A note on the uniformity threshold for Berge hypergraphs	1
Stability of extremal connected hypergraphs avoiding Berge-paths	1
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs	1
Optimally reconfiguring list and correspondence colourings	1
Monochromatic triangles in the max-norm plane	1
Localized versions of extremal problems	1
Gallai–Ramsey number of odd cycles with chords	1
On the tree-width of even-hole-free graphs	1
Vertex-primitive s-arc-transitive digraphs admitting a Suzuki or Ree	1
Sharp spectral bounds for the edge-connectivity of regular graphs	1
Extremal bipartite independence number and balanced coloring	1
Off-diagonal online size Ramsey numbers for paths	1
Quasiplanar graphs, string graphs, and the Erdős–Gallai problem	1
Vertex-weighted digraphs and freeness of arrangements between Shi and Ish	1
Normal 5-edge-coloring of some snarks superpositioned by Flower snarks	1
A new bound for the Maker–Breaker triangle game	1
More on rainbow cliques in edge-colored graphs	1
On the Erdős–Tuza–Valtr conjecture	1
Cycles in Austrian Solitaire	1
On saturation of Berge hypergraphs	1
On the maximum mean subtree order of trees	1
Shuffle squares and reverse shuffle squares	1
A tight lower bound on the matching number of graphs via Laplacian eigenvalues	1
On tilings of asymmetric limited-magnitude balls	1
Uniform intersecting families with large covering number	1