DeepAI AI Chat
Log In Sign Up

Shooting Stars in Simple Drawings of K_m,n

by   Oswin Aichholzer, et al.

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.


page 1

page 2

page 3

page 4


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

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

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

Empty Triangles in Generalized Twisted Drawings of K_n

Simple drawings are drawings of graphs in the plane or on the sphere suc...

The Partition Spanning Forest Problem

Given a set of colored points in the plane, we ask if there exists a cro...

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