Yiming Zhou

collaborators

2 papers

math.CO2026

Extremal problems in uniformly dense hypergraphs and digraphs

Hao Lin, Guanghui Wang, Wenling Zhou +1

The uniform TurÃ¡n density $I ¨ _{u} (F)$ of a $3$ -uniform hypergraph (or $3$ -graph) $F$ is the supremum of all $d$ such that there exist infinitely many $F$ -free $3$ -graphs $H$ in wh…

math.CO2025

Vertex-distinguishing edge coloring of graphs

Yuping Gao, Songling Shan, Guanghui Wang +1

Let $k \geq 1$ be an integer and let $G$ be a nonempty simple graph. An \emph{edge- $k$ -coloring} $I ¨ $ of $G$ is an assignment of colors from ${1, \dots, k}$ to the edges of $G$ suc…