Empty Triangles in Generalized Twisted Drawings of K_n

08/11/2022
by   Alfredo Garcia, et al.
0

Simple drawings are drawings of graphs in the plane or on the sphere such that vertices are distinct points, edges are Jordan arcs connecting their endpoints, and edges intersect at most once (either in a proper crossing or in a shared endpoint). Simple drawings are 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. We show that all generalized twisted drawings of K_n contain exactly 2n-4 empty triangles, by this making a substantial step towards proving the conjecture that this is the case for every simple drawing of K_n.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
01/16/2020

Extending drawings of complete graphs into arrangements of pseudocircles

Motivated by the successful application of geometry to proving the Harar...
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/23/2019

On the edge-vertex ratio of maximal thrackles

A drawing of a graph in the plane is a thrackle if every pair of edges i...
research
08/21/2019

Extending Simple Drawings

Simple drawings of graphs are those in which each pair of edges share at...
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
05/16/2018

The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete Graphs

The Harary-Hill Conjecture states that for n≥ 3 every drawing of K_n has...

Please sign up or login with your details

Forgot password? Click here to reset