Andrzej Rucinski

activity

20162026

most citedMinimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs

42 citations · 42 across the 9 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016★ 42 cited

Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs

Christian Reiher, Vojtěch Rödl, Andrzej Ruciński +2

We show that every 3-uniform hypergraph with $n$ vertices and minimum vertex degree at least $(5/9 + o (1)) (2 n)$ contains a tight Hamiltonian cycle. Known lower bound constructi…

math.CO2016

Short Proof of Erd\H os Conjecture for Triple Systems

Peter Frankl, Vojtech Rödl, Andrzej Ruciński

In 1965 Erd\H os conjectured that for all $k \geq 2$ , $s \geq 1$ and $n \geq k (s + 1)$ , an $n$ -vertex $k$ -uniform hypergraph $\F$ with $ν(\F)=s$ cannot have more than \newline $\max\{\binom{…