Hiêp Hàn

activity

20142026

most citedMinimum vertex degree conditions for loose Hamilton cycles in

3

-uniform hypergraphs

57 citations · 82 across the 11 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

math.CO2020★ 2 cited

Quasi-random words and limits of word sequences

Hiêp Hàn, Marcos Kiwi, Matías Pavez-Signé

Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we…

math.CO2020

Minimum degree thresholds for Hamilton $(k /2)$ -cycles in $k$ -uniform hypergraphs

Hiep Han, Jie Han, Yi Zhao

For any even integer $k \geq 6$ , integer $d$ such that $k /2 \leq d \leq k - 1$ , and sufficiently large $n \in (k /2) N$ , we find a tight minimum $d$ -degree condition that guarantees t…

math.CO2020

Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs

Hiep Hàn, Jie Han, Patrick Morris

We investigate the emergence of spanning structures in sparse pseudo-random $k$ -uniform hypergraphs, using the following comparatively weak notion of pseudo-randomness. A $k$ -unifo…

Quasi-random words and limits of word sequences

Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs

Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs

Minimum degree thresholds for Hamilton $(k /2)$ -cycles in $k$ -uniform hypergraphs