Jun-ming Gao

activity

20162023

most citedA unified proof of conjectures on cycle lengths in graphs

6 citations · 23 across the 19 of their papers we have counts for

collaborators

Showing 2020Show all

4 papers · 1 filter

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.CO2020★ 5 cited

On the rainbow matching conjecture for 3-uniform hypergraphs

Jun Gao, Hongliang Lu, Jie Ma +1

Aharoni and Howard, and, independently, Huang, Loh, and Sudakov proposed the following rainbow version of Erdős matching conjecture: For positive integers $n, k, m$ with $n \geq k m$ , i…

math.CO2020★ 1 cited

A Dirac-type theorem for uniform hypergraphs

Yue Ma, Xinmin Hou, Jun Gao

Dirac (1952) proved that every connected graph of order $n > 2 k + 1$ with minimum degree more than $k$ contains a path of length at least $2 k + 1$ . Erdős and Gallai (1959) showed that ev…

math.CO2020

Minimizing the number of edges in $C_{\geq r}$ -saturated graphs

Yue Ma, Xinmin Hou, Doudou Hei +1

Given a family of graphs $F$ , a graph $G$ is said to be $F$ -saturated if $G$ does not contain a copy of $F$ as a subgraph for any $F \in F$ but the addi…

A strengthening on odd cycles in graphs of given chromatic number

On the rainbow matching conjecture for 3-uniform hypergraphs

A Dirac-type theorem for uniform hypergraphs

Minimizing the number of edges in C≥r​-saturated graphs

Minimizing the number of edges in $C_{\geq r}$ -saturated graphs