Wiebke Bedenknecht

activity

20162018

most citedOn the local density problem for graphs of given odd-girth

6 citations · 10 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2018

Powers of tight Hamilton cycles in randomly perturbed hypergraphs

Wiebke Bedenknecht, Jie Han, Yoshiharu Kohayakawa +1

For $k \geq 2$ and $r \geq 1$ such that $k + r \geq 4$ , we prove that, for any $α > 0$ , there exists $ε > 0$ such that the union of an $n$ -vertex $k$ -graph with minimum codegree $\left(1-\bino…

math.CO2017★ 4 cited

Squares of Hamiltonian cycles in 3-uniform hypergraphs

Wiebke Bedenknecht, Christian Reiher

We show that every $3$ -uniform hypergraph $H = (V, E)$ with $∣ V (H) ∣ = n$ and minimum pair degree at least $(4/5 + o (1)) n$ contains a squared Hamiltonian cycle. This may be regarded as a f…

math.CO2016★ 6 cited

On the local density problem for graphs of given odd-girth

Wiebke Bedenknecht, Guilherme Oliveira Mota, Christian Reiher +1

Erdős conjectured that every $n$ -vertex triangle-free graph contains a subset of $⌊ n /2 ⌋$ vertices that spans at most $n^{2} /50$ edges. Extending a recent result of Norin…