Activities per year
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.
| Original language | English |
|---|---|
| Pages | 38-39 |
| Number of pages | 2 |
| Publication status | Published - Sept 2021 |
| Event | 23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games - Chiang Mai, Thailand Duration: 3 Sept 2021 → 5 Sept 2021 https://www.math.science.cmu.ac.th/tjcdcggg/ |
Conference
| Conference | 23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games |
|---|---|
| Abbreviated title | TJCDCG^3 2020+1 |
| Country/Territory | Thailand |
| City | Chiang Mai |
| Period | 3/09/21 → 5/09/21 |
| Internet address |
Fields of Expertise
- Information, Communication & Computing
Fingerprint
Dive into the research topics of 'Complete Geometric Graphs with no Partition into Plane Spanning Trees'. Together they form a unique fingerprint.Activities
- 1 Workshop, seminar or course (Participation in/Organisation of)
-
5th DACH Workshop on Arrangements and Drawings
Orthaber, J. (Participant)
16 Mar 2021 → 23 Mar 2021Activity: Participation in or organisation of › Workshop, seminar or course (Participation in/Organisation of)
Research output
- 1 Preprint
-
Edge Partitions of Complete Geometric Graphs (Part 1)
Obenaus, J. & Orthaber, J., 11 Aug 2021.Research output: Working paper › Preprint