Complete Geometric Graphs with no Partition into Plane Spanning Trees

Johannes Obenaus; Joachim Orthaber

Complete Geometric Graphs with no Partition into Plane Spanning Trees

Institut für Softwaretechnologie (7160)

Publikation: Konferenzbeitrag › Paper › Begutachtung

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.

Originalsprache	englisch
Seiten	38-39
Publikationsstatus	Veröffentlicht - Sept. 2021
Veranstaltung	23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games - Chiang Mai, Thailand Dauer: 3 Sept. 2021 → 5 Sept. 2021 https://www.math.science.cmu.ac.th/tjcdcggg/

Konferenz

Konferenz	23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games
Kurztitel	TJCDCG^3 2020+1
Land/Gebiet	Thailand
Ort	Chiang Mai
Zeitraum	3/09/21 → 5/09/21
Internetadresse	https://www.math.science.cmu.ac.th/tjcdcggg/

Fields of Expertise

Information, Communication & Computing

5th DACH Workshop on Arrangements and Drawings
Joachim Orthaber (Teilnehmer/-in)
16 März 2021 → 23 März 2021
Aktivität: Teilnahme an / Organisation von › Workshop, Seminar oder Kurs (Teilnahme an/Organisation von)

Dieses zitieren

@conference{2533088d36534c2f8084be08e91e3a20,

title = "Complete Geometric Graphs with no Partition into Plane Spanning Trees",

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.",

author = "Johannes Obenaus and Joachim Orthaber",

year = "2021",

month = sep,

language = "English",

pages = "38--39",

note = "23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games, TJCDCG^3 2020+1 ; Conference date: 03-09-2021 Through 05-09-2021",

url = "https://www.math.science.cmu.ac.th/tjcdcggg/",

}

TY - CONF

T1 - Complete Geometric Graphs with no Partition into Plane Spanning Trees

AU - Obenaus, Johannes

AU - Orthaber, Joachim

PY - 2021/9

Y1 - 2021/9

N2 - 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.

AB - 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.

M3 - Paper

SP - 38

EP - 39

T2 - 23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games

Y2 - 3 September 2021 through 5 September 2021

ER -

Complete Geometric Graphs with no Partition into Plane Spanning Trees

Abstract

Konferenz

Fields of Expertise

Fingerprint

Aktivitäten

5th DACH Workshop on Arrangements and Drawings

Dieses zitieren