Hiêp Hàn

According to our database1, Hiêp Hàn authored at least 22 papers between 2009 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Quasi-Random Words and Limits of Word Sequences.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles.
J. Graph Theory, 2019

2018
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs.
SIAM J. Discret. Math., 2018

Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors.
SIAM J. Discret. Math., 2018

2017
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles.
Electron. Notes Discret. Math., 2017

Linear quasi-randomness of subsets of abelian groups and hypergraphs.
Electron. Notes Discret. Math., 2017

Quasirandomness in hypergraphs.
Electron. Notes Discret. Math., 2017

Erdős-Ko-Rado for Random Hypergraphs: Asymptotics and Stability.
Comb. Probab. Comput., 2017

Powers of Hamilton cycles in pseudorandom graphs.
Comb., 2017

2015
Ramsey-type numbers involving graphs and hypergraphs with large girth.
Electron. Notes Discret. Math., 2015

Arithmetic progressions with a pseudorandom step.
Electron. Notes Discret. Math., 2015

2013
An approximate blow-up lemma for sparse pseudorandom graphs.
Electron. Notes Discret. Math., 2013

Extremal results for odd cycles in sparse pseudorandom graphs.
Electron. Notes Discret. Math., 2013

2012
Weak quasi-randomness for uniform hypergraphs.
Random Struct. Algorithms, 2012

2011
Extremal hypergraph theory and algorithmic regularity lemma for sparse graphs.
PhD thesis, 2011

Note on forcing pairs.
Electron. Notes Discret. Math., 2011

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs.
Electron. Notes Discret. Math., 2011

2010
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions.
SIAM J. Comput., 2010

Dirac-type results for loose Hamilton cycles in uniform hypergraphs.
J. Comb. Theory, Ser. B, 2010

2009
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree.
SIAM J. Discret. Math., 2009

Note on strong refutation algorithms for random k-SAT formulas.
Electron. Notes Discret. Math., 2009


  Loading...