Hong Liu

collaborators

4 papers

math.CO2026

Tight Staircase Bounds for Cyclic Subsets below Dirac's Threshold

Hong Liu, Mengyuan Niu, Lanchao Wang +1

Let $Cyc (G)$ denote the number of cyclic subsets in a graph $G$ , which are subsets that induce a Hamiltonian subgraph. DraganiÄ, Keevash and MÃ¼yesser recently prov…

math.CO2026

The sharp threshold for rainbow stackings of random edge-colourings

Hong Liu, Guorui Ma, Yangrui Xiang +1

A rainbow stacking of $m$ independent, uniformly random $r$ -edge-colourings of $K_{n}$ is a tuple of vertex permutations that superimposes the colourings such that no two edges of th…

math.CO2026

Colour diversity in spanning structures under Dirac-type conditions

Xinbu Cheng, Xinqi Huang, Hong Liu +2

Finding spanning structures with many distinct colours in properly edge-coloured graphs is a central theme in extremal combinatorics. A classical result of Andersen shows that ever…

math.CO2026

Infinitely many groups exhibiting intermediate growth in maximal sum-free sets

JÃ³zsef Balogh, Ramon I. Garcia, Hong Liu +1

Given an Abelian groups $G$ , denote $I^¼ (G)$ the size of its largest sum-free subset and $f_{m a x} (G)$ the number of maximal sum-free sets in $G$ . Confirming a prediction by Liu and…