Complete Geometric Graphs with no Partition into Plane Spanning Trees

Johannes Obenaus, Joachim Orthaber

Publikation: KonferenzbeitragPaperBegutachtung

Abstract

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.
Originalspracheenglisch
Seiten38-39
PublikationsstatusVeröffentlicht - Sep. 2021
Veranstaltung23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games - Chiang Mai, Thailand
Dauer: 3 Sep. 20215 Sep. 2021
https://www.math.science.cmu.ac.th/tjcdcggg/

Konferenz

Konferenz23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games
KurztitelTJCDCG^3 2020+1
Land/GebietThailand
OrtChiang Mai
Zeitraum3/09/215/09/21
Internetadresse

Fields of Expertise

  • Information, Communication & Computing

Fingerprint

Untersuchen Sie die Forschungsthemen von „Complete Geometric Graphs with no Partition into Plane Spanning Trees“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren