15 citations · 17 across the 3 of their papers we have counts for
4 papers · 1 filter
A spanning bandwidth theorem in random graphs
Peter Allen, Julia Böttcher, Julia Ehrenmüller +2
The bandwidth theorem [Mathematische Annalen, 343(1):175--205, 2009] states that any -vertex graph with minimum degree contains all -vertex -co…
The anti-Ramsey threshold of complete graphs
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Olaf Parczyk +1
For graphs and , let $G {\displaystyle\smash{\begin{subarray}{c} \hbox{$\tiny\rm rb$} \\ \longrightarrow \\ \hbox{$\tiny\rm p$} \end{subarray}}}H$ denote the property that f…
Loose Hamiltonian cycles forced by large -degree - sharp version
Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht +2
We prove for all and the sharp minimum -degree bound for a -uniform hypergraph on vertices to contain a Hamiltonian -cycl…
Loose Hamiltonian cycles forced by large -degree - approximate version
Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht +2
We prove that for all and , every -uniform hypergraph on vertices with $δ_{k-2}(\mathcal{H})\geq\left(\frac{4(k-\ell)-1}{4(k-\ell)^2}+…