default search action
Hiêp Hàn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j27]Hiêp Hàn, Jie Han, Yi Zhao:
Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs. J. Comb. Theory B 153: 105-148 (2022) - [j26]Hiêp Hàn, Jie Han, Patrick Morris
:
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs. Random Struct. Algorithms 61(1): 101-125 (2022) - 2021
- [j25]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): 722-740 (2021) - [j24]Hiêp Hàn, Marcos Kiwi, Matías Pavez-Signé
Quasi-random words and limits of word sequences. Eur. J. Comb. 98: 103403 (2021) - 2020
- [j23]Elad Aigner-Horev, Hiêp Hàn:
Linear quasi-randomness of subsets of abelian groups and hypergraphs. Eur. J. Comb. 88: 103116 (2020) - [c4]Hiêp Hàn, Marcos Kiwi, Matías Pavez-Signé:
Quasi-Random Words and Limits of Word Sequences. LATIN 2020: 491-503 - [c3]Hiêp Hàn, Jie Han, Patrick Morris:
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs. SODA 2020: 702-717 - [i1]Hiêp Hàn, Marcos Kiwi, Matías Pavez-Signé:
Quasi-random words and limits of word sequences. CoRR abs/2003.03664 (2020)
2010 – 2019
- 2019
- [j22]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): 5-15 (2019) - 2018
- [j21]Elad Aigner-Horev, David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht
Quasirandomness in Hypergraphs. Electron. J. Comb. 25(3): 3 (2018) - [j20]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): 826-838 (2018) - [j19]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): 1364-1368 (2018) - 2017
- [j18]Peter Allen, Julia Böttcher
Powers of Hamilton cycles in pseudorandom graphs. Comb. 37(4): 573-616 (2017) - [j17]Marcelo M. Gauy
Erdős-Ko-Rado for Random Hypergraphs: Asymptotics and Stability. Comb. Probab. Comput. 26(3): 406-422 (2017) - [j16]Elad Aigner-Horev
Quasirandomness in hypergraphs. Electron. Notes Discret. Math. 61: 13-19 (2017) - [j15]Elad Aigner-Horev
Linear quasi-randomness of subsets of abelian groups and hypergraphs. Electron. Notes Discret. Math. 61: 21-27 (2017) - [j14]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: 185-190 (2017) - 2015
- [j13]Elad Aigner-Horev
Arithmetic progressions with a pseudorandom step. Electron. Notes Discret. Math. 49: 447-455 (2015) - [j12]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: 457-463 (2015) - 2014
- [j11]Elad Aigner-Horev
Extremal results for odd cycles in sparse pseudorandom graphs. Comb. 34(4): 379-406 (2014) - [c2]Peter Allen, Julia Böttcher
Powers of Hamilton Cycles in Pseudorandom Graphs. LATIN 2014: 355-366 - 2013
- [j10]Elad Aigner-Horev
Extremal results for odd cycles in sparse pseudorandom graphs. Electron. Notes Discret. Math. 44: 385-391 (2013) - [j9]Peter Allen, Julia Böttcher
An approximate blow-up lemma for sparse pseudorandom graphs. Electron. Notes Discret. Math. 44: 393-398 (2013) - [j8]Enno Buß, Hiêp Hàn, Mathias Schacht
Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. J. Comb. Theory B 103(6): 658-678 (2013) - 2012
- [j7]David Conlon
Weak quasi-randomness for uniform hypergraphs. Random Struct. Algorithms 40(1): 1-38 (2012) - 2011
- [b1]Hiêp Hàn:
Extremal hypergraph theory and algorithmic regularity lemma for sparse graphs. Humboldt University of Berlin, 2011 - [j6]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: 207-212 (2011) - [j5]Hiêp Hàn, Yury Person
Note on forcing pairs. Electron. Notes Discret. Math. 38: 437-442 (2011) - 2010
- [j4]Hiêp Hàn, Mathias Schacht
Dirac-type results for loose Hamilton cycles in uniform hypergraphs. J. Comb. Theory B 100(3): 332-346 (2010) - [j3]Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. SIAM J. Comput. 39(6): 2336-2362 (2010)
2000 – 2009
- 2009
- [j2]Hiêp Hàn, Yury Person
Note on strong refutation algorithms for random k-SAT formulas. Electron. Notes Discret. Math. 35: 157-162 (2009) - [j1]Hiêp Hàn, Yury Person
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree. SIAM J. Discret. Math. 23(2): 732-748 (2009) - 2007
- [c1]Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. ICALP 2007: 789-800
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: