Hiêp Hàn

Publication Activity (10 Years)

Years Active: 2007-2022
Publications (10 Years): 17

Top Venues

Electron. Notes Discret. Math.

Comb. Probab. Comput.

Comb.

SIAM J. Discret. Math.

Humboldt University of Berlin (PHD)

Education History

Humboldt University of Berlin

PHD

Publications

Hiêp Hàn, Jie Han, Patrick Morris
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs. Random Struct. Algorithms 61 (1) (2022)
Hiêp Hàn, Jie Han, Yi Zhao
-uniform hypergraphs. J. Comb. Theory, Ser. B 153 (2022)
Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht
Ramsey-type numbers involving graphs and hypergraphs with large girth. Comb. Probab. Comput. 30 (5) (2021)
Hiêp Hàn, Marcos Kiwi, Matías Pavez-Signé
Quasi-random words and limits of word sequences. Eur. J. Comb. 98 (2021)
Elad Aigner-Horev, Hiêp Hàn
Linear quasi-randomness of subsets of abelian groups and hypergraphs. Eur. J. Comb. 88 (2020)
Hiêp Hàn, Jie Han, Patrick Morris
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs. SODA (2020)
Hiêp Hàn, Marcos Kiwi, Matías Pavez-Signé
Quasi-random words and limits of word sequences. CoRR (2020)
Hiêp Hàn, Marcos Kiwi, Matías Pavez-Signé
Quasi-Random Words and Limits of Word Sequences. LATIN (2020)
Sebastián Bustamante, Hiêp Hàn, Maya Stein
Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles. J. Graph Theory 91 (1) (2019)
Hiêp Hàn, Vojtech Rödl, Tibor Szabó
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs. SIAM J. Discret. Math. 32 (2) (2018)
Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
Quasirandomness in Hypergraphs. Electron. J. Comb. 25 (3) (2018)
Hiêp Hàn, Andrea Jiménez
Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors. SIAM J. Discret. Math. 32 (2) (2018)
Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
Powers of Hamilton cycles in pseudorandom graphs. Comb. 37 (4) (2017)
Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
Quasirandomness in hypergraphs. Electron. Notes Discret. Math. 61 (2017)
Sebastián Bustamante, Hiêp Hàn, Maya Stein
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles. Electron. Notes Discret. Math. 61 (2017)
Elad Aigner-Horev, Hiêp Hàn
Linear quasi-randomness of subsets of abelian groups and hypergraphs. Electron. Notes Discret. Math. 61 (2017)
Marcelo M. Gauy, Hiêp Hàn, Igor Carboni Oliveira
Erdős-Ko-Rado for Random Hypergraphs: Asymptotics and Stability. Comb. Probab. Comput. 26 (3) (2017)
Elad Aigner-Horev, Hiêp Hàn
Arithmetic progressions with a pseudorandom step. Electron. Notes Discret. Math. 49 (2015)
Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht
Ramsey-type numbers involving graphs and hypergraphs with large girth. Electron. Notes Discret. Math. 50 (2015)
Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
Powers of Hamilton Cycles in Pseudorandom Graphs. LATIN (2014)
Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht
Extremal results for odd cycles in sparse pseudorandom graphs. Comb. 34 (4) (2014)
Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
An approximate blow-up lemma for sparse pseudorandom graphs. Electron. Notes Discret. Math. 44 (2013)
Enno Buß, Hiêp Hàn, Mathias Schacht
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. J. Comb. Theory, Ser. B 103 (6) (2013)
Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht
Extremal results for odd cycles in sparse pseudorandom graphs. Electron. Notes Discret. Math. 44 (2013)
David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
Weak quasi-randomness for uniform hypergraphs. Random Struct. Algorithms 40 (1) (2012)
Hiêp Hàn, Yury Person, Mathias Schacht
Note on forcing pairs. Electron. Notes Discret. Math. 38 (2011)
Enno Buß, Hiêp Hàn, Mathias Schacht
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. Electron. Notes Discret. Math. 38 (2011)
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. SIAM J. Comput. 39 (6) (2010)
Hiêp Hàn, Mathias Schacht
Dirac-type results for loose Hamilton cycles in uniform hypergraphs. J. Comb. Theory, Ser. B 100 (3) (2010)
Hiêp Hàn, Yury Person, Mathias Schacht
Note on strong refutation algorithms for random k-SAT formulas. Electron. Notes Discret. Math. 35 (2009)
Hiêp Hàn, Yury Person, Mathias Schacht
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree. SIAM J. Discret. Math. 23 (2) (2009)
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. ICALP (2007)

Hiêp Hàn.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hiêp Hàn