4 papers · 1 filter
A hitting-time version of Kotzig's conjecture in random graphs
Stefan Glock, Lyuben Lichev, Amedeo Sgueglia
A family of perfect matchings on the same vertex set is said to have the Kotzig property if the union of any pair of matchings forms a Hamilton cycle. Kotzig famously conjectured t…
On Kotzig's conjecture in random graphs
Stefan Glock, Amedeo Sgueglia
In 1963, Anton Kotzig famously conjectured that , the complete graph of order , where is even, can be decomposed into perfect matchings such that every pair of…
Steiner triple systems with high discrepancy
Lior Gishboliner, Stefan Glock, Amedeo Sgueglia
In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed and , any -co…
Defect and transference versions of the Alon-Frankl-Lovasz theorem
Lior Gishboliner, Stefan Glock, Peleg Michaeli +1
Confirming a conjecture of Erdős on the chromatic number of Kneser hypergraphs, Alon, Frankl and Lovász proved that in any -colouring of the edges of the complete -uniform hy…