12 citations · 40 across the 27 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 1 cited
On extremal hypergraphs for hamiltonian cycles
Roman Glebov, Yury Person, Wilma Weps
We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Turán- and Dirac-type results. While the Turán-type result gives an exact threshold for the ap…
math.CO2011
An improved error term for minimum H-decompositions of graphs
Peter Allen, Julia Böttcher, Yury Person
We consider partitions of the edge set of a graph G into copies of a fixed graph H and single edges. Let ϕ_H(n) denote the minimum number p such that any n-vertex G admits such a p…