Ping Zhang

most citedMonochromatic loose path partitions in k-uniform hypergraphs

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2019

Extremal Problems in Royal Colorings of Graphs

Akbar Ali, Gary Chartrand, James Hallas +1

An edge coloring $c$ of a graph $G$ is a royal $k$ -edge coloring of $G$ if the edges of $G$ are assigned nonempty subsets of the set ${1, 2, \dots, k}$ in such a way that the ve…

math.CO2016★ 1 cited

Monochromatic loose path partitions in k-uniform hypergraphs

Changhong Lu, Bing Wang, Ping Zhang

A conjecture of Gyárfás and Sárközy says that in every $2$ -coloring of the edges of the complete $k$ -uniform hypergraph $K_{n}^{k}$ , there are two disjoint monochromatic loose paths of…