collaborators

1 paper

math.CO2026

Superlinear Lower Bounds for Monochromatic Path Partitions

Heng Li, Lanchao Wang

In 1989, Gyárfás conjectured that the vertex set of every -edge-coloured complete graph can be partitioned into at most vertex-disjoint monochromatic paths. Erdős, Gyárfás,…