Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHong Liu 0010
Person information
- affiliation: Institute for Basic Science (IBS), Extremal Combinatorics and Probability Group (ECOPRO), Daejeon, South Korea
- affiliation: University of Warwick, Mathematics Institute and DIMAP, Coventry, UK
Other persons with the same name
- Hong Liu — disambiguation page
- Hong Liu 0001 — Shandong University, School of Computer Science and Technology, Jinan, China
- Hong Liu 0002
![[0000-0003-3629-2626]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-3629-2626")
— Harbin Institute of Technology, State Key Laboratory of Robotics and Systems, China (and 1 more) - Hong Liu 0003 — University of Oklahoma, School of Electrical and Computer Engineering, Norman, OK, USA
- Hong Liu 0004 — University of Maryland at College Park, Department of Computer Science, MD, USA
- Hong Liu 0005 — Huazhong University of Science and Technology, School of Computer Science and Technology, Wuhan, China (and 1 more)
- Hong Liu 0006 — East China Normal University, School of Computer Science and Software Engineering, China (and 2 more)
- Hong Liu 0007 — Chinese Academy of Sciences, Institute of Computing Technology, Beijing Key Laboratory of Mobile Computing and Pervasive Device, China
- Hong Liu 0008 — Peking University, Shenzhen Graduate School, Key Laboratory of Machine Perception, Engineering Lab on Intelligent Perception for Internet of Things, Beijing, China (and 1 more)
- Hong Liu 0009 — National Institute of Informatics, Japan (and 1 more)
- Hong Liu 0011 — Beijing University of Posts and Telecommunications, State Key Laboratory of Information Photonics and Optical Communications, School of Information and Communication Engineering, , Beijing, China
- Hong Liu 0012 — Embry-Riddle Aeronautical University, Daytona Beach, USA
- Hong Liu 0013 — Shandong Normal University, School of Information Science and Engineering, Jinan, China (and 2 more)
- Hong Liu 0014 — Jilin University, State Key Laboratory of Theoretical and Computational Chemistry, Changchun, China
- Hong Liu 0015 — Tianjin University, Key Laboratory of Smart Grid of Ministry of Education, Tianjin, China
- Hong Liu 0016 — Washington University in St. Louis, Olin Business School, St. Louis, MO, USA
- Hong Liu 0017 — Communications Research Centre Canada, Ottawa, Canada
- Hong Liu 0018 — Chinese Academy of Sciences, Institute of Computing Technology, Beijing, China
- Hong Liu 0019 — University of Massachusetts, Dartmouth, MA, USA
- Hong Liu 0020 — Southwest University, School of Electronic and Information Engineering, Chongqing, China
- Hong Liu 0021 — Liaoning Normal University, Dalian, China
- Hong Liu 0022 — Oklahoma State University, Department of Computer Science, Stillwater, OK, USA
- Hong Liu 0023 — Zhejiang Gongshang University, College of Computer and Information Engineering, Hangzhou, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j36]Stijn Cambie, Jun Gao, Hong Liu:
Many Hamiltonian subsets in large graphs with given density. Comb. Probab. Comput. 33(1): 110-120 (2024)- 2023
- [j35]Jun Gao, Hong Liu, Zixiang Xu:
Stability Through Non-Shadows. Comb. 43(6): 1125-1137 (2023) - [j34]Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, Hong Liu:
Fractional Helly Theorem for Cartesian Products of Convex Sets. Discret. Comput. Geom. 70(4): 1632-1651 (2023) - [j33]Hong Liu, Guanghui Wang, Laurence Wilkes, Donglei Yang:
Shape of the asymptotic maximum sum-free sets in integer lattice grids. Eur. J. Comb. 107: 103614 (2023) - [j32]Irene Gil Fernández, Joseph Hyde, Hong Liu, Oleg Pikhurko, Zhuo Wu:
Disjoint isomorphic balanced clique subdivisions. J. Comb. Theory, Ser. B 161: 417-436 (2023) - [j31]Irene Gil Fernández, Hong Liu:
How to build a pillar: A proof of Thomassen's conjecture. J. Comb. Theory, Ser. B 162: 13-33 (2023) - 2022
- [j30]Hong Liu, Péter Pál Pach, Csaba Sándor:
Polynomial Schur's Theorem. Comb. 42(Supplement 2): 1357-1384 (2022) - [j29]Hong Liu, Guanghui Wang, Donglei Yang:
Clique immersion in graphs without a fixed bipartite graph. J. Comb. Theory, Ser. B 157: 346-365 (2022) - 2021
- [j28]Hong Liu, Maryam Sharifzadeh, Katherine Staden:
On the Maximum Number of Integer Colourings with Forbidden Monochromatic Sums. Electron. J. Comb. 28(1): 1 (2021) - [j27]Hong Liu, Péter Pál Pach, Richárd Palincza:
The number of maximum primitive sets of integers. Comb. Probab. Comput. 30(5): 781-795 (2021) - [j26]Hong Liu, Maryam Sharifzadeh:
Groups with few maximal sum-free sets. J. Comb. Theory, Ser. A 177: 105333 (2021) - [j25]Dong Yeap Kang, Jaehoon Kim, Hong Liu:
On the rational Turán exponents conjecture. J. Comb. Theory, Ser. B 148: 149-172 (2021) - 2020
- [j24]Hong Liu, Sammy Luo, Peter Nelson, Kazuhiro Nomoto:
Stability and exact Turán numbers for matroids. J. Comb. Theory, Ser. B 143: 29-41 (2020) - [j23]Jaehoon Kim, Younjin Kim, Hong Liu:
Tree decompositions of graphs without large bipartite holes. Random Struct. Algorithms 57(1): 150-168 (2020) - 2019
- [j22]József Balogh, Shagnik Das, Hong Liu, Maryam Sharifzadeh, Tuan Tran:
Structure and Supersaturation for Intersecting Families. Electron. J. Comb. 26(2): 2 (2019) - [j21]Hong Liu, Oleg Pikhurko, Maryam Sharifzadeh:
Edges not in any monochromatic copy of a fixed graph. J. Comb. Theory, Ser. B 135: 16-43 (2019) - [j20]Hong Liu, Péter Pál Pach:
The number of multiplicative Sidon sets of integers. J. Comb. Theory, Ser. A 165: 152-175 (2019) - [j19]Jaehoon Kim, Younjin Kim, Hong Liu:
Two Conjectures in Ramsey-Turán Theory. SIAM J. Discret. Math. 33(1): 564-586 (2019) - [j18]Joseph Hyde, Hong Liu, Andrew Treglown:
A Degree Sequence Komlós Theorem. SIAM J. Discret. Math. 33(4): 2041-2061 (2019) - 2018
- [j17]József Balogh, Hong Liu, Richard Montgomery:
Rainbow spanning trees in properly coloured complete graphs. Discret. Appl. Math. 247: 97-101 (2018) - 2017
- [j16]József Balogh, Neal Bushaw, Maurício Collares Neto, Hong Liu, Robert Morris, Maryam Sharifzadeh:
The typical structure of graphs with no large cliques. Comb. 37(4): 617-632 (2017) - [j15]Hong Liu, Maryam Sharifzadeh, Katherine Staden:
Local Conditions for Exponentially Many Subdivisions. Comb. Probab. Comput. 26(3): 423-430 (2017) - [j14]Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král', Hong Liu:
Densities in large permutations and parameter testing. Eur. J. Comb. 60: 89-99 (2017) - [j13]Jaehoon Kim, Hong Liu, Maryam Sharifzadeh, Katherine Staden:
Proof of Komlós's conjecture on Hamiltonian subsets. Electron. Notes Discret. Math. 61: 727-733 (2017) - [j12]Hong Liu, Oleg Pikhurko, Katherine Staden:
The minimum number of triangles in graphs of given order and size. Electron. Notes Discret. Math. 61: 805-811 (2017) - [j11]Hong Liu, Richard Montgomery:
A proof of Mader's conjecture on large clique subdivisions in C4-free graphs. J. Lond. Math. Soc. 95(1): 203-222 (2017) - [j10]József Balogh, Hong Liu, Maryam Sharifzadeh:
On Two Problems in Ramsey-Turán Theory. SIAM J. Discret. Math. 31(3): 1848-1866 (2017) - 2015
- [j9]József Balogh, Hong Liu, Maryam Sharifzadeh, Andrew Treglown:
A sharp bound on the number of maximal sum-free sets. Electron. Notes Discret. Math. 49: 57-64 (2015) - [j8]József Balogh, Hong Liu, Maryam Sharifzadeh:
Subdivisions of a large clique in C6-free graphs. J. Comb. Theory, Ser. B 112: 18-35 (2015) - [j7]József Balogh, Shagnik Das, Michelle Delcourt, Hong Liu, Maryam Sharifzadeh:
Intersecting families of discrete structures are typically trivial. J. Comb. Theory, Ser. A 132: 224-245 (2015) - 2014
- [j6]Maria Axenovich, András Gyárfás, Hong Liu, Dhruv Mubayi:
Multicolor Ramsey numbers for triple systems. Discret. Math. 322: 69-77 (2014) - [j5]József Balogh, Ping Hu, Bernard Lidický, Hong Liu:
Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube. Eur. J. Comb. 35: 75-85 (2014) - [j4]József Balogh, Hong Liu:
On the number of K4-saturating edges. J. Comb. Theory, Ser. B 109: 250-257 (2014) - 2013
- [j3]Hong Liu:
Extremal Graphs for Blow-Ups of Cycles and Trees. Electron. J. Comb. 20(1): 65 (2013) - [j2]Asaf Ferber, Roman Glebov, Michael Krivelevich, Hong Liu, Cory Palmer, Tomás Valla, Máté Vizer:
The Biased Odd Cycle Game. Electron. J. Comb. 20(2): 9 (2013) - [j1]Hong Liu, Bernard Lidický, Cory Palmer:
On the Turán Number of Forests. Electron. J. Comb. 20(2): 62 (2013)
Informal and Other Publications
- 2021
- [i3]Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, Hong Liu:
Well-mixing vertices and almost expanders. CoRR abs/2108.12864 (2021) - [i2]Jaehoon Kim, Hong Liu, Tuan Tran:
Exponential decay of intersection volume with applications on list-decodability and Gilbert-Varshamov type bound. CoRR abs/2112.11274 (2021) - 2014
- [i1]Roman Glebov, Carlos Hoppen, Tereza Klimosová, Yoshiharu Kohayakawa, Daniel Král, Hong Liu:
Large permutations and parameter testing. CoRR abs/1412.5622 (2014)
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-04-18 22:45 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:
