All Good Drawings of Small Complete Graphs

Good drawings (also known as simple topological graphs) are drawings of graphs such that any two edges intersect at most once. Such drawings have attracted attention as generalizations of geometric graphs, in connection with the crossing number, and as data structures in their own right. We are in particular interested in good drawings of the complete graph. In this extended abstract, we describe our techniques for generating all different weak isomorphism classes of good drawings of the complete graph for up to nine vertices. In addition, all isomorphism classes were enumerated. As an application of the obtained data, we present several existential and extremal properties of these drawings.

[1]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[2]  Jj Anos Pach.  Which Crossing Number Is It Anyway? , 1998 .

[3]  Heiko Harborth.  Empty triangles in drawings of the complete graph , 1998, Discret. Math..

[4]  Franz Aurenhammer,et al.  Enumerating Order Types for Small Point Sets with Applications , 2002, Order.

[5]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[6]  János Pach,et al.  How Many Ways Can One Draw A Graph? , 2003, Comb..

[7]  János Pach,et al.  Unavoidable Configurations in Complete Topological Graphs , 2000, GD.

[8]  Emeric Gioan,et al.  Complete Graph Drawings up to Triangle Mutations , 2005, Discrete & Computational Geometry.

[9]  Jason S. Williford,et al.  On the independence number of the Erdos-Rényi and projective norm graphs and a related hypergraph , 2007 .

[10]  Shengjun Pan,et al.  The crossing number of K11 is 100 , 2007, J. Graph Theory.

[11]  Jan Kyncl.  Enumeration of simple complete topological graphs , 2009, Eur. J. Comb..

[12]  Michael J. Pelsmajer,et al.  Crossing Numbers of Graphs with Rotation Systems , 2007, Algorithmica.

[13]  R. Bruce Richter,et al.  A Parity Theorem for Drawings of Complete and Complete Bipartite Graphs , 2010, Am. Math. Mon..

[14]  Jan Kyncl,et al.  Simple Realizability of Complete Abstract Topological Graphs in P , 2011, Discret. Comput. Geom..

[15]  Jan Kyncl,et al.  Improved Enumeration of Simple Topological Graphs , 2012, Discrete & Computational Geometry.

[16]  Oswin Aichholzer,et al.  Shellable Drawings and the Cylindrical Crossing Number of $$K_{n}$$Kn , 2014, Discret. Comput. Geom..

[17]  Shengjun Pan,et al.  On the crossing number of K13 , 2015, J. Comb. Theory, Ser. B.

[18]  Alexander Pilz,et al.  Empty Triangles in Good Drawings of the Complete Graph , 2015, Graphs Comb..