Bad drawings of small complete graphs
From MaRDI portal
Publication:5206933
zbMATH Open1429.05147arXiv1903.06292MaRDI QIDQ5206933FDOQ5206933
Authors: Grant Cairns, Emily Groves, Yuri Nikolayevsky
Publication date: 19 December 2019
Abstract: We show that for (resp.~ ) there is a drawing with independent crossings, and no pair of independent edges cross more than once, provided is odd with (resp.~ ). Conversely, using the deleted product cohomology, we show that for and , if is any set of pairs of independent edges, and has odd cardinality, then there is a drawing in the plane for which each element in cross an odd number of times, while each pair of independent edges not in cross an even number of times. For we show that there is a drawing with independent crossings, and no pair of independent edges cross more than once, if and only if .
Full work available at URL: https://arxiv.org/abs/1903.06292
Recommendations
Cites Work
- Title not available (Why is that?)
- Crossing Numbers of Graphs
- Title not available (Why is that?)
- Obstructions to the imbedding of a complex in a euclidean space. I: The first obstruction
- Simple realizability of complete abstract topological graphs in P
- Points Multiples D'Une Application et Produit Cyclique Reduit
- Title not available (Why is that?)
- Title not available (Why is that?)
- A polynomial-time algorithm to find a linkless embedding of a graph
- Decidability of string graphs
- Configuration spaces of colored graphs.
- A course in topological combinatorics
- Topology of configuration space of two particles on a graph. I.
- Toward a theory of crossing numbers
- Generalized thrackle drawings of non-bipartite graphs
- Title not available (Why is that?)
- The Fundamental Group of Certain Deleted Product Spaces
- Homology of Deleted Products in Dimension One
- Über wesentlich unplättbare Kurven im dreidimensionalen Raume
- Noncrossing Subgraphs in Topological Layouts
- Title not available (Why is that?)
- Title not available (Why is that?)
- A one-dimensional Whitney trick and Kuratowski's graph planarity criterion
- A note on the parity of the number of crossings of a graph
- Hanani-Tutte and Related Results
- On approximability by embeddings of cycles in the plane.
- Title not available (Why is that?)
- Some Examples Relating the Deleted Product to Imbeddability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic characterizations of outerplanar and planar graphs
- A parity theorem for drawings of complete and complete
Cited In (3)
This page was built for publication: Bad drawings of small complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206933)