Qingyi Huo

activity

20192021

most citedA unified proof of conjectures on cycle lengths in graphs

6 citations · 9 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2021★ 1 cited

A note on cycle lengths in graphs of chromatic number five and six

Qingyi Huo

In this note, we prove that every non-complete $(k + 1)$ -critical graph contains cycles of all lengths modulo $k$ , where $k = 4, 5$ .

math.CO2020★ 2 cited

A strengthening on odd cycles in graphs of given chromatic number

Jun Gao, Qingyi Huo, Jie Ma

Resolving a conjecture of Bollobás and Erdős, Gyárfás proved that every graph $G$ of chromatic number $k + 1 \geq 3$ contains cycles of $⌊ \frac{k}{2} ⌋$ distinct odd length…

math.CO2019★ 6 cited

A unified proof of conjectures on cycle lengths in graphs

Jun Gao, Qingyi Huo, Chun-Hung Liu +1

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression…