12 citations · 40 across the 27 of their papers we have counts for
4 papers · 1 filter
Making spanning graphs
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +2
We prove that for each there exists such that whenever , in the Maker-Breaker game played on , Maker has a s…
Quasirandomness in hypergraphs
E. Aigner-Horev, D. Conlon, H. Hàn +2
An -vertex graph of edge density is considered to be quasirandom if it shares several important properties with the random graph . A well-known theorem of Chung,…
Finding tight Hamilton cycles in random hypergraphs faster
Peter Allen, Christoph Koch, Olaf Parczyk +1
In an -uniform hypergraph on vertices a tight Hamilton cycle consists of edges such that there exists a cyclic ordering of the vertices where the edges correspond to con…
Minimum Rainbow -Decompositions of Graphs
Lale Özkahya, Yury Person
Given graphs and , we consider the problem of decomposing a properly edge-colored graph into few parts consisting of rainbow copies of and single edges. We establish…