◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Hong Liu

62 papers hereh-index 18947 citations73 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author17
  • middle author28
  • last author16

Across the 62 of 62 papers where every author was matched, so the position is known.

fields
  • math.CO58
  • math.NT2
  • cs.DM1
  • math.PR1
same name
  • Hong Liu — 112 papers, h 61
  • Hong Liu — 21 papers, h 24
  • Hong Liu — 16 papers, h 16
  • Hong Liu — 15 papers, h 12
  • Hong Liu — 14 papers, h 37
  • Hong Liu — 14 papers, h 7

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20102026
most citedUpper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube

58 citations · 220 across the 56 of their papers we have counts for

collaborators
Showing 2020Show all

4 papers · 1 filter

math.CO2020★ 21 cited

Extremal density for sparse minors and subdivisions

John Haslegrave, Jaehoon Kim, Hong Liu

We prove an asymptotically tight bound on the extremal density guaranteeing subdivisions of bounded-degree bipartite graphs with a mild separability condition. As corollaries, we a…

math.CO2020★ 5 cited

Stability from graph symmetrisation arguments with applications to inducibility

Hong Liu, Oleg Pikhurko, Maryam Sharifzadeh +1

We present a sufficient condition for the stability property of extremal graph problems that can be solved via Zykov's symmetrisation. Our criterion is stated in terms of an analyt…

math.CO2020★ 3 cited

Clique immersion in graphs without fixed bipartite graph

Hong Liu, Guanghui Wang, Donglei Yang

A graph G contains H as an \emph{immersion} if there is an injective mapping ϕ:V(H)→V(G) such that for each edge uv∈E(H), there is a path Puv​ in G joi…

math.CO2020★ 6 cited

A solution to Erdős and Hajnal's odd cycle problem

Hong Liu, Richard Montgomery

In 1981, Erdős and Hajnal asked whether the sum of the reciprocals of the odd cycle lengths in a graph with infinite chromatic number is necessarily infinite. Let C(G)…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.