F. Schulenburg

most citedLoose Hamiltonian cycles forced by large

(k - 2)

-degree - approximate version

15 citations · 25 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2017★ 2 cited

Loose Hamiltonian cycles forced by large $(k - 2)$ -degree - sharp version

Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht +2

We prove for all $k \geq 4$ and $1 \leq ℓ < k /2$ the sharp minimum $(k - 2)$ -degree bound for a $k$ -uniform hypergraph $H$ on $n$ vertices to contain a Hamiltonian $ℓ$ -cycl…

math.CO2016★ 15 cited

Loose Hamiltonian cycles forced by large $(k - 2)$ -degree - approximate version

Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht +2

We prove that for all $k \geq 4$ and $1 \leq ℓ < k /2$ , every $k$ -uniform hypergraph $H$ on $n$ vertices with $δ_{k-2}(\mathcal{H})\geq\left(\frac{4(k-\ell)-1}{4(k-\ell)^2}+…

math.CO2016★ 8 cited

Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs

Mathias Schacht, Fabian Schulenburg

For a given graph $F$ we consider the family of (finite) graphs $G$ with the Ramsey property for $F$ , that is the set of such graphs $G$ with the property that every two-colouring…

Loose Hamiltonian cycles forced by large (k−2)-degree - sharp version

Loose Hamiltonian cycles forced by large (k−2)-degree - approximate version

Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs

Loose Hamiltonian cycles forced by large $(k - 2)$ -degree - sharp version

Loose Hamiltonian cycles forced by large $(k - 2)$ -degree - approximate version