Bad drawings of small complete graphs
From MaRDI portal
Publication:5206933
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 .
Recommendations
Cites work
- scientific article; zbMATH DE number 3159958 (Why is no real title available?)
- scientific article; zbMATH DE number 4139770 (Why is no real title available?)
- scientific article; zbMATH DE number 3503275 (Why is no real title available?)
- scientific article; zbMATH DE number 3636243 (Why is no real title available?)
- scientific article; zbMATH DE number 7030516 (Why is no real title available?)
- scientific article; zbMATH DE number 2145228 (Why is no real title available?)
- scientific article; zbMATH DE number 3283314 (Why is no real title available?)
- scientific article; zbMATH DE number 3330607 (Why is no real title available?)
- scientific article; zbMATH DE number 3394160 (Why is no real title available?)
- scientific article; zbMATH DE number 3412663 (Why is no real title available?)
- A course in topological combinatorics
- A note on the parity of the number of crossings of a graph
- A one-dimensional Whitney trick and Kuratowski's graph planarity criterion
- A parity theorem for drawings of complete and complete
- A polynomial-time algorithm to find a linkless embedding of a graph
- Algebraic characterizations of outerplanar and planar graphs
- Configuration spaces of colored graphs.
- Crossing numbers of graphs
- Decidability of string graphs
- Generalized thrackle drawings of non-bipartite graphs
- Hanani-Tutte and related results
- Homology of Deleted Products in Dimension One
- Noncrossing Subgraphs in Topological Layouts
- Obstructions to the imbedding of a complex in a euclidean space. I: The first obstruction
- On approximability by embeddings of cycles in the plane.
- Points Multiples D'Une Application et Produit Cyclique Reduit
- Simple realizability of complete abstract topological graphs in P
- Some Examples Relating the Deleted Product to Imbeddability
- Superthrackles
- The Fundamental Group of Certain Deleted Product Spaces
- Topology of configuration space of two particles on a graph. I.
- Toward a theory of crossing numbers
- Über wesentlich unplättbare Kurven im dreidimensionalen Raume
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)