We enumerate lattice paths in the planar integer lattice consisting of positively directed unit vertical and horizontal steps with respect to a specific elliptic weight function. ...
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a p...
The codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free r-graphs G on n vertices such that every set of r−1 vertices is contained in at le...
Let the k-graph Fank consist of k edges that pairwise intersect exactly in one vertex x, plus one more edge intersecting each of these edges in a vertex different from x. We prov...
In two previous papers, the study of partitions with short sequences has been developed both for its intrinsic interest and for a variety of applications. The object of this paper...
George Andrews, Henrik Eriksson, Fedor Petrov, Dan...