Activities per year
It is a long-standing conjecture that every complete geometric graph on 2n vertices can be partitioned into n plane spanning trees. Despite several approaches, it remained open to this day. In this note we provide a family of counterexamples, based on bumpy wheel sets.
|Publication status||Published - Sep 2021|
|Event||23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games - Chiang Mai, Thailand|
Duration: 3 Sep 2021 → 5 Sep 2021
|Conference||23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games|
|Abbreviated title||TJCDCG^3 2020+1|
|Period||3/09/21 → 5/09/21|