Sciweavers

114
Voted
EJC
2016
9 years 12 months ago
Uniform eventown problems
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...
Peter Frankl, Norihide Tokushige
102
Voted
EJC
2016
9 years 12 months ago
Generalized Dyck tilings
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...
Matthieu Josuat-Vergès, Jang Soo Kim
102
Voted
EJC
2016
9 years 12 months ago
Cycles with consecutive odd lengths
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 ...
Jie Ma
98
Voted
EJC
2016
9 years 12 months ago
Detecting minors in matroids through triangles
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,...
Boris Albar, Daniel Gonçalves 0001, Jorge L...
99
Voted
EJC
2016
9 years 12 months ago
Decomposing plane cubic graphs
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 ...
Kenta Ozeki, Dong Ye 0002
94
Voted
EJC
2016
9 years 12 months ago
Small circulant complex Hadamard matrices of Butson type
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...
Gaurush Hiranandani, Jean-Marc Schlenker
88
Voted
EJC
2016
9 years 12 months ago
Regularity lemmas in a Banach space setting
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...
Guus Regts
93
Voted
EJC
2016
9 years 12 months ago
Complexity of short rectangles and periodicity
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...
Van Cyr, Bryna Kra
178
Voted
EJC
2016
9 years 12 months ago
First-fit coloring on interval graphs has performance ratio at least 5
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...
Hal A. Kierstead, David A. Smith, William T. Trott...
104
Voted
EJC
2016
9 years 12 months ago
Constructions of transitive latin hypercubes
A function
Denis S. Krotov, Vladimir N. Potapov