Edge Partitions of Complete Geometric Graphs (Part 1)

08/11/2021
by   Johannes Obenaus, et al.
0

In this paper, we disprove the long-standing conjecture that any complete geometric graph on 2n vertices can be partitioned into n plane spanning trees. Our construction is based on so-called bumpy wheel sets. We fully characterize which bumpy wheels can and in particular which cannot be partitioned into plane spanning trees (or even into arbitrary plane subgraphs), including a complete description of all possible partitions (into plane spanning trees). Furthermore, we show a sufficient condition for generalized wheels to not admit a partition into plane spanning trees, and give a complete characterization when they admit a partition into plane spanning double stars.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/15/2021

Edge Partitions of Complete Geometric Graphs (Part 2)

Recently, the second and third author showed that complete geometric gra...
07/18/2017

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs

We consider the following question: How many edge-disjoint plane spannin...
03/06/2018

Packing Plane Spanning Trees into a Point Set

Let P be a set of n points in the plane in general position. We show tha...
05/27/2015

New characterizations of minimum spanning trees and of saliency maps based on quasi-flat zones

We study three representations of hierarchies of partitions: dendrograms...
09/27/2018

(g,f)-Chromatic spanning trees and forests

A heterochromatic (or rainbow) graph is an edge-colored graph whose edge...
06/25/2020

Reconfiguration of Spanning Trees with Many or Few Leaves

Let G be a graph and T_1,T_2 be two spanning trees of G. We say that T_1...
07/29/2021

Generalisations of Matrix Partitions : Complexity and Obstructions

A trigraph is a graph where each pair of vertices is labelled either 0 (...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.