5 papers
Minimum degree thresholds for Hamilton -cycles in -uniform hypergraphs
Hiep Han, Jie Han, Yi Zhao
For any even integer , integer such that , and sufficiently large , we find a tight minimum -degree condition that guarantees t…
Maximum number of sum-free colorings in finite abelian groups
Hiep Hàn, Andrea Jiménez
An -coloring of a subset of a finite abelian group is called sum-free if it does not induce a monochromatic Schur triple, i.e., a triple of elements with $a…
Ramsey-type numbers involving graphs and hypergraphs with large girth
H. Hàn, T. Retter, V. Rödl +1
A question of Erdős asks if for every pair of positive integers and , there exists a graph having and the property that every -colouring of the…
Minimum vertex degree conditions for loose Hamilton cycles in -uniform hypergraphs
E. Buß, H. Hàn, M. Schacht
We investigate minimum vertex degree conditions for -uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which…
Extremal results for odd cycles in sparse pseudorandom graphs
Elad Aigner-Horev, Hiep Hàn, Mathias Schacht
We consider extremal problems for subgraphs of pseudorandom graphs. For graphs and the generalized Turán density denotes the density of a maximum subgraph of ,…