B. Schülke

activity

20192024

most citedMinimum pair degree condition for tight Hamiltonian cycles in

4

-uniform hypergraphs

5 citations · 5 across the 7 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

math.CO2020

$r$ -cross $t$ -intersecting families via necessary intersection points

Pranshu Gupta, Yannick Mogge, Simón Piga +1

Given integers $r \geq 2$ and $n, t \geq 1$ we call families $F_{1}, \dots, F_{r} \subseteq P ([n])$ $r$ -cross $t$ -intersecting if for all $F_{i} \in F_{i}$ ,…

math.CO2020★ 5 cited

Minimum pair degree condition for tight Hamiltonian cycles in $4$ -uniform hypergraphs

Joanna Polcyn, Christian Reiher, Vojtěch Rödl +3

We show that every 4-uniform hypergraph with $n$ vertices and minimum pair degree at least $(5/9 + o (1)) n^{2} /2$ contains a tight Hamiltonian cycle. This degree condition is asymptotic…

r-cross t-intersecting families via necessary intersection points

Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs

$r$ -cross $t$ -intersecting families via necessary intersection points

Minimum pair degree condition for tight Hamiltonian cycles in $4$ -uniform hypergraphs