Shooting Stars in Simple Drawings of K_m,n

09/02/2022
by   Oswin Aichholzer, et al.
0

Simple drawings are drawings of graphs in which two edges have at most one common point (either a common endpoint, or a proper crossing). It has been an open question whether every simple drawing of a complete bipartite graph K_m,n contains a plane spanning tree as a subdrawing. We answer this question to the positive by showing that for every simple drawing of K_m,n and for every vertex v in that drawing, the drawing contains a shooting star rooted at v, that is, a plane spanning tree containing all edges incident to v.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/16/2019

Extending simple drawings with one edge is hard

A simple drawing D(G) of a graph G = (V,E) is a drawing in which two edg...
research
08/20/2020

Plane Spanning Trees in Edge-Colored Simple Drawings of K_n

Károlyi, Pach, and Tóth proved that every 2-edge-colored straight-line d...
research
03/11/2022

Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs

Simple drawings are drawings of graphs in which the edges are Jordan arc...
research
05/16/2023

Using SAT to study plane Hamiltonian substructures in simple drawings

In 1988 Rafla conjectured that every simple drawing of a complete graph ...
research
08/11/2022

Empty Triangles in Generalized Twisted Drawings of K_n

Simple drawings are drawings of graphs in the plane or on the sphere suc...
research
08/25/2020

On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens

A star-simple drawing of a graph is a drawing in which adjacent edges do...
research
01/23/2023

Breaking the Boundaries of Knowledge Space: Analyzing the Knowledge Spanning on the Q A Website through Word Embeddings

The challenge of raising a creative question exists in recombining diffe...

Please sign up or login with your details

Forgot password? Click here to reset