Hiêp Hàn

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

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

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

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

Quasirandomness in Hypergraphs.
Electr. J. Comb., 2018

2017
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles.
Electronic Notes in Discrete Mathematics, 2017

Linear quasi-randomness of subsets of abelian groups and hypergraphs.
Electronic Notes in Discrete Mathematics, 2017

Quasirandomness in hypergraphs.
Electronic Notes in Discrete Mathematics, 2017

Erdős-Ko-Rado for Random Hypergraphs: Asymptotics and Stability.
Combinatorics, Probability & Computing, 2017

2015
Ramsey-type numbers involving graphs and hypergraphs with large girth.
Electronic Notes in Discrete Mathematics, 2015

Arithmetic progressions with a pseudorandom step.
Electronic Notes in Discrete Mathematics, 2015

2014
Extremal results for odd cycles in sparse pseudorandom graphs.
Combinatorica, 2014

Powers of Hamilton Cycles in Pseudorandom Graphs.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs.
J. Comb. Theory, Ser. B, 2013

An approximate blow-up lemma for sparse pseudorandom graphs.
Electronic Notes in Discrete Mathematics, 2013

Extremal results for odd cycles in sparse pseudorandom graphs.
Electronic Notes in Discrete Mathematics, 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.
Electronic Notes in Discrete Mathematics, 2011

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs.
Electronic Notes in Discrete Mathematics, 2011

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. Discrete Math., 2009

Note on strong refutation algorithms for random k-SAT formulas.
Electronic Notes in Discrete Mathematics, 2009

2007
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007


  Loading...