Hong Liu

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 2016Show all

4 papers · 1 filter

math.CO2016

Local conditions for exponentially many subdivisions

Hong Liu, Maryam Sharifzadeh, Katherine Staden

Given a graph $F$ , let $s_{t} (F)$ be the number of subdivisions of $F$ , each with a different vertex set, which one can guarantee in a graph $G$ in which every edge lies in at least…

math.CO2016

On two problems in Ramsey-Turán theory

József Balogh, Hong Liu, Maryam Sharifzadeh

Alon, Balogh, Keevash and Sudakov proved that the $(k - 1)$ -partite Turán graph maximizes the number of distinct $r$ -edge-colorings with no monochromatic $K_{k}$ for all fixed $k$ and…

math.CO2016★ 30 cited

A proof of Mader's conjecture on large clique subdivisions in $C_{4}$ -free graphs

Hong Liu, Richard Montgomery

Given any integers $s, t \geq 2$ , we show there exists some $c = c (s, t) > 0$ such that any $K_{s, t}$ -free graph with average degree $d$ contains a subdivision of a clique with at least $…

math.CO2016★ 2 cited

The number of subsets of integers with no $k$ -term arithmetic progression

József Balogh, Hong Liu, Maryam Sharifzadeh

Addressing a question of Cameron and Erd\Ho s, we show that, for infinitely many values of $n$ , the number of subsets of ${1, 2, \dots, n}$ that do not contain a $k$ -term arithmet…

Local conditions for exponentially many subdivisions

On two problems in Ramsey-Turán theory

A proof of Mader's conjecture on large clique subdivisions in C4​-free graphs

The number of subsets of integers with no k-term arithmetic progression

A proof of Mader's conjecture on large clique subdivisions in $C_{4}$ -free graphs

The number of subsets of integers with no $k$ -term arithmetic progression