Yan Wang

collaborators

3 papers

math.CO2025

Path decompositions of Eulerian graphs

Yanan Chu, Yan Wang

Gallai's conjecture asserts that every connected graph on $n$ vertices can be decomposed into $\frac{n + 1}{2}$ paths. For general graphs (possibly disconnected), it was proved that…

math.CO2025

On the number of triangles in $K_{4}$ -free graphs

Jialin He, Jie Ma, Yan Wang +1

ErdÅs asked whether for any $n$ -vertex graph $G$ , the parameter $p^{*} (G) = min \sum_{i \geq 1} (∣ V (G_{i}) ∣ - 1)$ is at most $⌊ n^{2} /4 ⌋$ , where the minimum is taken over all edg…

math.CO2025

Partition subcubic planar graphs into independent sets

Xujun Liu, Yan Wang

A packing $(1^{ℓ}, 2^{k})$ -coloring of a graph $G$ is a partition of $V (G)$ into $ℓ$ independent sets and $k$ $2$ -packings (whose pairwise vertex distance is at least $3$ ). The…

Path decompositions of Eulerian graphs

On the number of triangles in K4​-free graphs

Partition subcubic planar graphs into independent sets

On the number of triangles in $K_{4}$ -free graphs