Generalized thrackles and geometric graphs in R^3 with no pair of strongly avoiding edges
From MaRDI portal
Publication:1014822
geometric graphmaximum numberof diametersorthogonal projectionpoint set in R3strongly avoiding edgesVazsonyi's conjecture
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75) Erd?s problems and related topics of discrete geometry (52C10) Relations of low-dimensional topology with graph theory (57M15)
Recommendations
Cites work
- Bounds for generalized thrackles
- Generalized thrackle drawings of non-bipartite graphs
- scientific article; zbMATH DE number 3122839 (Why is no real title available?)
- scientific article; zbMATH DE number 3126120 (Why is no real title available?)
- On Conway's thrackle conjecture
- On Sets of Distances of n Points
Cited in
(7)
This page was built for publication: Generalized thrackles and geometric graphs in \({\mathbb{R}}^3\) with no pair of strongly avoiding edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014822)