collaborators

1 paper

math.CO2022

Gallai's Conjecture for Complete and "Nearly Complete" Graphs

Hua Wang, Andrew Zhang

The famous Gallai's Conjecture states that any connected graph with n vertices has a path decomposition containing at most (n+1)/2 paths. In this note, we explore graphs generated…