Yanli Hao

collaborators

3 papers

math.CO2026

Improved bounds for the chromatic index of $k$ -uniform hypergraphs

Sarah Frederickson, Yanli Hao, Tom Kelly

In 1997, Alon and Kim conjectured that if $H$ is a $k$ -uniform $t$ -simple hypergraph with maximum degree $D$ sufficiently large, then the chromatic index $I ¨ ^{'} (H)$ is upper bounded…

math.CO2026

Strong chromatic index of bipartite graphs

Yanli Hao, Tianchi Yang, Xingxing Yu

An edge-coloring of a graph $G$ is called a strong edge-coloring if all its color classes are induced matchings in $G$ ; the minimum number of colors required for such a coloring, d…

math.CO2024

A short proof of the Goldberg-Seymour conjecture

Guantao Chen, Yanli Hao, Xingxing Yu +1

For a multigraph $G$ , $I ¨ ^{'} (G)$ denotes the chromatic index of $G$ , $I^ (G)$ the maximum degree of $G$ , and $Î(G) = \max\left\{\left\lceil \frac{2|E(H)|}{|V(H)|-1} \right\rceil: H \…

Improved bounds for the chromatic index of k-uniform hypergraphs

Strong chromatic index of bipartite graphs

A short proof of the Goldberg-Seymour conjecture

Improved bounds for the chromatic index of $k$ -uniform hypergraphs