Hiêp Hàn

According to our database, Hiêp Hàn authored at least 23 papers between 2009 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2022

Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs.

Hiêp Hàn, Jie Han, Patrick Morris

Random Struct. Algorithms, 2022

Minimum degree thresholds for Hamilton (<i>k</i>/2)-cycles in <i>k</i>-uniform hypergraphs.

Hiêp Hàn, Jie Han, Yi Zhao

J. Comb. Theory, Ser. B, 2022

2021

Quasi-random words and limits of word sequences.

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

Eur. J. Comb., 2021

2019

Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles.

Sebastián Bustamante, Hiêp Hàn, Maya Stein

J. Graph Theory, 2019

2018

Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs.

Hiêp Hàn, Vojtech Rödl, Tibor Szabó

SIAM J. Discret. Math., 2018

Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors.

Hiêp Hàn, Andrea Jiménez

SIAM J. Discret. Math., 2018

2017

Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles.

Sebastián Bustamante, Hiêp Hàn, Maya Stein

Electron. Notes Discret. Math., 2017

Linear quasi-randomness of subsets of abelian groups and hypergraphs.

Elad Aigner-Horev, Hiêp Hàn

Electron. Notes Discret. Math., 2017

Quasirandomness in hypergraphs.

Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht

Electron. Notes Discret. Math., 2017

Erdős-Ko-Rado for Random Hypergraphs: Asymptotics and Stability.

Marcelo M. Gauy, Hiêp Hàn, Igor C. Oliveira

Comb. Probab. Comput., 2017

Powers of Hamilton cycles in pseudorandom graphs.

Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person

Comb., 2017

2015

Ramsey-type numbers involving graphs and hypergraphs with large girth.

Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht

Electron. Notes Discret. Math., 2015

Arithmetic progressions with a pseudorandom step.

Elad Aigner-Horev, Hiêp Hàn

Electron. Notes Discret. Math., 2015

2013

An approximate blow-up lemma for sparse pseudorandom graphs.

Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person

Electron. Notes Discret. Math., 2013

Extremal results for odd cycles in sparse pseudorandom graphs.

Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht

Electron. Notes Discret. Math., 2013

2012

Weak quasi-randomness for uniform hypergraphs.

David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht

Random Struct. Algorithms, 2012

2011

Extremal hypergraph theory and algorithmic regularity lemma for sparse graphs.

Hiêp Hàn

PhD thesis, 2011

Note on forcing pairs.

Hiêp Hàn, Yury Person, Mathias Schacht

Electron. Notes Discret. Math., 2011

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs.

Enno Buß, Hiêp Hàn, Mathias Schacht

Electron. Notes Discret. Math., 2011

2010

Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions.

Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht

SIAM J. Comput., 2010

Dirac-type results for loose Hamilton cycles in uniform hypergraphs.

Hiêp Hàn, Mathias Schacht

J. Comb. Theory, Ser. B, 2010

2009

On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree.

Hiêp Hàn, Yury Person, Mathias Schacht

SIAM J. Discret. Math., 2009

Note on strong refutation algorithms for random k-SAT formulas.

Hiêp Hàn, Yury Person, Mathias Schacht

Electron. Notes Discret. Math., 2009