Hong Liu

Orcid: 0000-0002-5735-7321

Affiliations:
  • Institute for Basic Science (IBS), Extremal Combinatorics and Probability Group (ECOPRO), Daejeon, South Korea
  • University of Warwick, Mathematics Institute and DIMAP, Coventry, UK


According to our database1, Hong Liu authored at least 39 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Many Hamiltonian subsets in large graphs with given density.
Comb. Probab. Comput., January, 2024

2023
Fractional Helly Theorem for Cartesian Products of Convex Sets.
Discret. Comput. Geom., December, 2023

Stability Through Non-Shadows.
Comb., December, 2023

Disjoint isomorphic balanced clique subdivisions.
J. Comb. Theory, Ser. B, July, 2023

How to build a pillar: A proof of Thomassen's conjecture.
J. Comb. Theory, Ser. B, 2023

Shape of the asymptotic maximum sum-free sets in integer lattice grids.
Eur. J. Comb., 2023

2022
Polynomial Schur's Theorem.
Comb., December, 2022

Clique immersion in graphs without a fixed bipartite graph.
J. Comb. Theory, Ser. B, 2022

2021
On the rational Turán exponents conjecture.
J. Comb. Theory, Ser. B, 2021

Groups with few maximal sum-free sets.
J. Comb. Theory, Ser. A, 2021

The number of maximum primitive sets of integers.
Comb. Probab. Comput., 2021

Exponential decay of intersection volume with applications on list-decodability and Gilbert-Varshamov type bound.
CoRR, 2021

Well-mixing vertices and almost expanders.
CoRR, 2021

On the Maximum Number of Integer Colourings with Forbidden Monochromatic Sums.
Electron. J. Comb., 2021

2020
Tree decompositions of graphs without large bipartite holes.
Random Struct. Algorithms, 2020

Stability and exact Turán numbers for matroids.
J. Comb. Theory, Ser. B, 2020

2019
Two Conjectures in Ramsey-Turán Theory.
SIAM J. Discret. Math., 2019

A Degree Sequence Komlós Theorem.
SIAM J. Discret. Math., 2019

Edges not in any monochromatic copy of a fixed graph.
J. Comb. Theory, Ser. B, 2019

The number of multiplicative Sidon sets of integers.
J. Comb. Theory, Ser. A, 2019

Structure and Supersaturation for Intersecting Families.
Electron. J. Comb., 2019

2018
Rainbow spanning trees in properly coloured complete graphs.
Discret. Appl. Math., 2018

2017
On Two Problems in Ramsey-Turán Theory.
SIAM J. Discret. Math., 2017

A proof of Mader's conjecture on large clique subdivisions in C4-free graphs.
J. Lond. Math. Soc., 2017

The minimum number of triangles in graphs of given order and size.
Electron. Notes Discret. Math., 2017

Proof of Komlós's conjecture on Hamiltonian subsets.
Electron. Notes Discret. Math., 2017

Densities in large permutations and parameter testing.
Eur. J. Comb., 2017

Local Conditions for Exponentially Many Subdivisions.
Comb. Probab. Comput., 2017

The typical structure of graphs with no large cliques.
Comb., 2017

2015
Subdivisions of a large clique in C6-free graphs.
J. Comb. Theory, Ser. B, 2015

Intersecting families of discrete structures are typically trivial.
J. Comb. Theory, Ser. A, 2015

A sharp bound on the number of maximal sum-free sets.
Electron. Notes Discret. Math., 2015

2014
On the number of K<sub>4</sub>-saturating edges.
J. Comb. Theory, Ser. B, 2014

Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube.
Eur. J. Comb., 2014

Multicolor Ramsey numbers for triple systems.
Discret. Math., 2014

Large permutations and parameter testing.
CoRR, 2014

2013
On the Turán Number of Forests.
Electron. J. Comb., 2013

Extremal Graphs for Blow-Ups of Cycles and Trees.
Electron. J. Comb., 2013

The Biased Odd Cycle Game.
Electron. J. Comb., 2013


  Loading...