57 citations · 82 across the 11 of their papers we have counts for
14 papers
Low discrepancy and spectral gap for directed hypergraphs via spectral regularity lemma for tensors
Hiep Han
We show that low discrepancy is equivalent to spectral gap for directed -uniform hypergraphs. For undirected hypergraphs this recovers a theorem of Lenz and Mubayi, with a consi…
Maximum number of edge colorings avoiding rainbow copies of
Hiêp Hàn, Carlos Hoppen, Nicolas Moro Müller +1
In this paper we show that for and any sufficiently large -vertex graph the number of -edge-colorings of with no rainbow is at most ,…
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…
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…
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 -uniform hypergraphs, using the following comparatively weak notion of pseudo-randomness. A -unifo…
Quasirandomness in hypergraphs
E. Aigner-Horev, D. Conlon, H. Hàn +2
An -vertex graph of edge density is considered to be quasirandom if it shares several important properties with the random graph . A well-known theorem of Chung,…
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…
Blow-up lemmas for sparse graphs
Peter Allen, Julia Böttcher, Hiep Hàn +2
The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. Thi…
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 ,…
A sharp threshold for van der Waerden's theorem in random subsets
E. Friedgut, H. Hàn, Y. Person +1
We establish sharpness for the threshold of van der Waerden's theorem in random subsets of . More precisely, for and $Z\subseteq \mathbb{Z}/n\math…
Erdős-Ko-Rado for random hypergraphs: asymptotics and stability
Marcelo M. Gauy, Hiêp Hàn, Igor C. Oliveira
We investigate the asymptotic version of the Erdős-Ko-Rado theorem for the random -uniform hypergraph . For , let and $D…
Powers of Hamilton cycles in pseudorandom graphs
Peter Allen, Julia Böttcher, Hiep Hàn +2
We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph is …