Generalized thrackles and geometric graphs in \({\mathbb{R}}^3\) with no pair of strongly avoiding edges

DOI10.1007/s00373-008-0796-6zbMath1188.05055OpenAlexW2018476804MaRDI QIDQ1014822

Amitai Perlstein, Rom Pinchasi

Publication date: 29 April 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0796-6

zbMATH Keywords

geometric graphorthogonal projectionmaximum numberof diameterspoint set in R3strongly avoiding edgesVazsonyi's conjecture

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Relations of low-dimensional topology with graph theory (57M15) Erd?s problems and related topics of discrete geometry (52C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Ball polytopes and the Vázsonyi problem ⋮ Tangled Thrackles ⋮ A new proof of Vázsonyi's conjecture ⋮ A computational approach to Conway's thrackle conjecture ⋮ Great-circle spherical thrackles ⋮ Generalized thrackle drawings of non-bipartite graphs

Cites Work

• Generalized thrackle drawings of non-bipartite graphs
• On Conway's thrackle conjecture
• Bounds for generalized thrackles
• On Sets of Distances of n Points
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized thrackles and geometric graphs in \({\mathbb{R}}^3\) with no pair of strongly avoiding edges