Hiệp Hàn

548 total citations
21 papers, 221 citations indexed

About

Hiệp Hàn is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Hiệp Hàn has authored 21 papers receiving a total of 221 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Discrete Mathematics and Combinatorics, 17 papers in Computational Theory and Mathematics and 10 papers in Geometry and Topology. Recurrent topics in Hiệp Hàn's work include Limits and Structures in Graph Theory (20 papers), Advanced Graph Theory Research (13 papers) and graph theory and CDMA systems (8 papers). Hiệp Hàn is often cited by papers focused on Limits and Structures in Graph Theory (20 papers), Advanced Graph Theory Research (13 papers) and graph theory and CDMA systems (8 papers). Hiệp Hàn collaborates with scholars based in Chile, Germany and Brazil. Hiệp Hàn's co-authors include Mathias Schacht, Yury Person, David Conlon, Vojtěch Rödl, Amin Coja‐Oghlan, Mihyun Kang, Noga Alon, Peter Allen, Maya Stein and Yoshiharu Kohayakawa and has published in prestigious journals such as SIAM Journal on Computing, Journal of Combinatorial Theory Series B and COMBINATORICA.

In The Last Decade

Hiệp Hàn

18 papers receiving 205 citations

Peers

Hiệp Hàn

DMC

CTM

EEE

Yury Person Germany

Allan Lo United Kingdom

Julia Böttcher United Kingdom

Andrew Treglown United Kingdom

Tom Sanders United Kingdom

Brendan Nagle United States

Richard Mycroft United Kingdom

Nathan Lemons Hungary

Choongbum Lee United States

Randall McCutcheon United States

Yury Person Germany

Hiệp Hàn

276 ×1.4

DMC

238 ×1.5

CTM

169 ×1.4

68 ×0.8

EEE

15 ×2.5

Citations per year, relative to Hiệp Hàn Hiệp Hàn (= 1×) peers Yury Person

Countries citing papers authored by Hiệp Hàn

Since Specialization

Citations

This map shows the geographic impact of Hiệp Hàn's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Hiệp Hàn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hiệp Hàn more than expected).

Fields of papers citing papers by Hiệp Hàn

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hiệp Hàn. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Hiệp Hàn. The network helps show where Hiệp Hàn may publish in the future.

Co-authorship network of co-authors of Hiệp Hàn

This figure shows the co-authorship network connecting the top 25 collaborators of Hiệp Hàn. A scholar is included among the top collaborators of Hiệp Hàn based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Hiệp Hàn. Hiệp Hàn is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Hàn, Hiệp, et al.. (2025). Color-Bias Perfect Matchings in Hypergraphs. SIAM Journal on Discrete Mathematics. 39(3). 1894–1916.

Hàn, Hiệp, et al.. (2021). Ramsey-type numbers involving graphs and hypergraphs with large girth. Combinatorics Probability Computing. 30(5). 722–740.

Hàn, Hiệp, Jie Han, & Yi Zhao. (2021). Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs. Journal of Combinatorial Theory Series B. 153. 105–148. 4 indexed citations

Hàn, Hiệp, et al.. (2021). Quasi-random words and limits of word sequences. European Journal of Combinatorics. 98. 103403–103403. 2 indexed citations

Hàn, Hiệp, et al.. (2019). Maximum number of triangle-free edge colourings with five and six colours. London School of Economics and Political Science Research Online (London School of Economics and Political Science). 88(3). 495–499. 3 indexed citations

Hàn, Hiệp, Vojtěch Rödl, & Tibor Szabó. (2018). Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs. SIAM Journal on Discrete Mathematics. 32(2). 826–838. 6 indexed citations

Hàn, Hiệp, et al.. (2018). Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors. SIAM Journal on Discrete Mathematics. 32(2). 1364–1368. 7 indexed citations

Hàn, Hiệp, et al.. (2018). Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles. Journal of Graph Theory. 91(1). 5–15. 4 indexed citations

Bustamante, Sebastián, Hiệp Hàn, & Maya Stein. (2017). Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles. Electronic Notes in Discrete Mathematics. 61. 185–190. 1 indexed citations

10.

Hàn, Hiệp, et al.. (2017). Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability. Combinatorics Probability Computing. 26(3). 406–422.

11.

Allen, Peter, Julia Böttcher, Hiệp Hàn, Yoshiharu Kohayakawa, & Yury Person. (2016). Powers of Hamilton cycles in pseudorandom graphs. COMBINATORICA. 37(4). 573–616. 9 indexed citations

12.

Hàn, Hiệp, et al.. (2013). Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. Journal of Combinatorial Theory Series B. 103(6). 658–678. 26 indexed citations

13.

Hàn, Hiệp, et al.. (2013). Extremal results for odd cycles in sparse pseudorandom graphs. Electronic Notes in Discrete Mathematics. 44. 385–391. 1 indexed citations

14.

Conlon, David, Hiệp Hàn, Yury Person, & Mathias Schacht. (2011). Weak quasi‐randomness for uniform hypergraphs. Random Structures and Algorithms. 40(1). 1–38. 25 indexed citations

15.

Hàn, Hiệp, Yury Person, & Mathias Schacht. (2011). Note on forcing pairs. Electronic Notes in Discrete Mathematics. 38. 437–442. 2 indexed citations

16.

Hàn, Hiệp, et al.. (2011). Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. Electronic Notes in Discrete Mathematics. 38. 207–212. 2 indexed citations

17.

Alon, Noga, Amin Coja‐Oghlan, Hiệp Hàn, et al.. (2010). Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions. SIAM Journal on Computing. 39(6). 2336–2362. 15 indexed citations

18.

Hàn, Hiệp & Mathias Schacht. (2009). Dirac-type results for loose Hamilton cycles in uniform hypergraphs. Journal of Combinatorial Theory Series B. 100(3). 332–346. 39 indexed citations

19.

Hàn, Hiệp, Yury Person, & Mathias Schacht. (2009). Note on strong refutation algorithms for random k-SAT formulas. Electronic Notes in Discrete Mathematics. 35. 157–162. 2 indexed citations

20.

Hàn, Hiệp, Yury Person, & Mathias Schacht. (2009). On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree. SIAM Journal on Discrete Mathematics. 23(2). 732–748. 71 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact