EJC
2016
8 years 22 days ago
2016
Let n ≥ k ≥ l ≥ 2 be integers, and let F be a family of k-element subsets of an n-element set. Suppose that l divides the size of the intersection of any two (not necessarily...
EJC
2016
8 years 22 days ago
2016
zed Dyck tilings (Extended Abstract) Matthieu Josuat-Verg´es1∗ and Jang Soo Kim 2† 1 IGM, Universit´e de Marne-la-Vall´ee, France 2 Department of Mathematics, Sungkyunkwan U...
EJC
2016
8 years 22 days ago
2016
In this paper we prove that there exists an absolute constant c > 0 such that for every natural number k, every non-bipartite 2-connected graph with average degree at least ck ...
EJC
2016
8 years 22 days ago
2016
Abstract. In this note we investigate some matroid minor structure results. In particular, we present sufficient conditions, in terms of triangles, for a matroid to have either U2,...
EJC
2016
8 years 22 days ago
2016
It was conjectured by Hoffmann-Ostenhof that the edge set of every cubic graph can be decomposed into a spanning tree, a matching and a family of cycles. We prove the conjecture ...
EJC
2016
8 years 22 days ago
2016
We study the circulant complex Hadamard matrices of order n whose entries are l-th roots of unity. For n = l prime we prove that the only such matrix, up to equivalence, is the Fou...
EJC
2016
8 years 22 days ago
2016
Szemer´edi’s regularity lemma is a fundamental tool in extremal graph theory, theoretical computer science and combinatorial number theory. Lov´asz and Szegedy [7] gave a Hilb...
EJC
2016
8 years 22 days ago
2016
The Morse-Hedlund Theorem states that a bi-infinite sequence η in a finite alphabet is periodic if and only if there exists n ∈ N such that the block complexity function Pη(n...
EJC
2016
8 years 22 days ago
2016
First-fit is the online graph coloring algorithm that considers vertices one at a time in some order and assigns each vertex the least positive integer not used already on a neigh...
EJC
2016
8 years 22 days ago
2016
A function