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

03/11/2022
by   Oswin Aichholzer, et al.
0

Simple drawings are drawings of graphs in which the edges are Jordan arcs and each pair of edges share at most one point (a proper crossing or a common endpoint). We introduce a special kind of simple drawings that we call generalized twisted drawings. A simple drawing is generalized twisted if there is a point O such that every ray emanating from O crosses every edge of the drawing at most once and there is a ray emanating from O which crosses every edge exactly once. Via this new class of simple drawings, we show that every simple drawing of the complete graph with n vertices contains Ω(n^1/2) pairwise disjoint edges and a plane path of length Ω(log n /loglog n). Both results improve over previously known best lower bounds. On the way we show several structural results about and properties of generalized twisted drawings. We further present different characterizations of generalized twisted drawings, which might be of independent interest.

READ FULL TEXT

page 11

page 13

page 15

page 23

page 25

page 29

page 31

page 33

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
09/02/2022

Shooting Stars in Simple Drawings of K_m,n

Simple drawings are drawings of graphs in which two edges have at most o...
research
08/21/2023

Different Types of Isomorphisms of Drawings of Complete Multipartite Graphs

Simple drawings are drawings of graphs in which any two edges intersect ...
research
08/21/2019

Extending Simple Drawings

Simple drawings of graphs are those in which each pair of edges share at...
research
01/16/2020

Extending drawings of complete graphs into arrangements of pseudocircles

Motivated by the successful application of geometry to proving the Harar...
research
05/16/2018

The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs

The Harary-Hill Conjecture states that for n≥ 3 every drawing of K_n has...
research
08/23/2018

Crossing Minimization in Perturbed Drawings

Due to data compression or low resolution, nearby vertices and edges of ...

Please sign up or login with your details

Forgot password? Click here to reset