Hiêp Hàn

34 papers A* 2B 2Journal 29
YearRankTypeTitle / Venue / Authors
2025 J jnl
Color-Bias Perfect Matchings in Hypergraphs.
SIAM J. Discret. Math.
Hiêp Hàn, Richard Lang, João Pedro Marciano, Matías Pavez-Signé, Nicolás Sanhueza-Matamala, Andrew Treglown, Camila Zárate-Guerén
2022 J jnl
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs.
Random Struct. Algorithms
Hiêp Hàn, Jie Han, Patrick Morris
2022 J jnl
Minimum degree thresholds for Hamilton (
J. Comb. Theory B
Hiêp Hàn, Jie Han, Yi Zhao
2021 J jnl
Quasi-random words and limits of word sequences.
Eur. J. Comb.
Hiêp Hàn, Marcos Kiwi, Matías Pavez-Signé
2021 J jnl
Ramsey-type numbers involving graphs and hypergraphs with large girth.
Comb. Probab. Comput.
Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht
2020 A* conf
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs.
SODA
Hiêp Hàn, Jie Han, Patrick Morris
2020 J jnl
Linear quasi-randomness of subsets of abelian groups and hypergraphs.
Eur. J. Comb.
Elad Aigner-Horev, Hiêp Hàn
2020 B conf
Quasi-Random Words and Limits of Word Sequences.
LATIN
Hiêp Hàn, Marcos Kiwi, Matías Pavez-Signé
2020 J jnl
Quasi-random words and limits of word sequences.
CoRR
Hiêp Hàn, Marcos Kiwi, Matías Pavez-Signé
2019 J jnl
Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles.
J. Graph Theory
Sebastián Bustamante, Hiêp Hàn, Maya Stein
2018 J jnl
Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors.
SIAM J. Discret. Math.
Hiêp Hàn, Andrea Jiménez
2018 J jnl
Quasirandomness in Hypergraphs.
Electron. J. Comb.
Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
2018 J jnl
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs.
SIAM J. Discret. Math.
Hiêp Hàn, Vojtech Rödl, Tibor Szabó
2017 J jnl
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles.
Electron. Notes Discret. Math.
Sebastián Bustamante, Hiêp Hàn, Maya Stein
2017 J jnl
Erdős-Ko-Rado for Random Hypergraphs: Asymptotics and Stability.
Comb. Probab. Comput.
Marcelo M. Gauy, Hiêp Hàn, Igor C. Oliveira
2017 J jnl
Linear quasi-randomness of subsets of abelian groups and hypergraphs.
Electron. Notes Discret. Math.
Elad Aigner-Horev, Hiêp Hàn
2017 J jnl
Powers of Hamilton cycles in pseudorandom graphs.
Comb.
Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
2017 J jnl
Quasirandomness in hypergraphs.
Electron. Notes Discret. Math.
Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
2015 J jnl
Arithmetic progressions with a pseudorandom step.
Electron. Notes Discret. Math.
Elad Aigner-Horev, Hiêp Hàn
2015 J jnl
Ramsey-type numbers involving graphs and hypergraphs with large girth.
Electron. Notes Discret. Math.
Hiêp Hàn, Troy Retter, Vojtech Rödl, Mathias Schacht
2014 J jnl
Extremal results for odd cycles in sparse pseudorandom graphs.
Comb.
Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht
2014 B conf
Powers of Hamilton Cycles in Pseudorandom Graphs.
LATIN
Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
2013 J jnl
An approximate blow-up lemma for sparse pseudorandom graphs.
Electron. Notes Discret. Math.
Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
2013 J jnl
Extremal results for odd cycles in sparse pseudorandom graphs.
Electron. Notes Discret. Math.
Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht
2013 J jnl
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs.
J. Comb. Theory B
Enno Buß, Hiêp Hàn, Mathias Schacht
2012 J jnl
Weak quasi-randomness for uniform hypergraphs.
Random Struct. Algorithms
David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
2011 — —
Extremal hypergraph theory and algorithmic regularity lemma for sparse graphs.
Hiêp Hàn
2011 J jnl
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs.
Electron. Notes Discret. Math.
Enno Buß, Hiêp Hàn, Mathias Schacht
2011 J jnl
Note on forcing pairs.
Electron. Notes Discret. Math.
Hiêp Hàn, Yury Person, Mathias Schacht
2010 J jnl
Dirac-type results for loose Hamilton cycles in uniform hypergraphs.
J. Comb. Theory B
Hiêp Hàn, Mathias Schacht
2010 J jnl
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions.
SIAM J. Comput.
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht
2009 J jnl
Note on strong refutation algorithms for random k-SAT formulas.
Electron. Notes Discret. Math.
Hiêp Hàn, Yury Person, Mathias Schacht
2009 J jnl
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree.
SIAM J. Discret. Math.
Hiêp Hàn, Yury Person, Mathias Schacht
2007 A* conf
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions.
ICALP
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht