An improved constant factor for the unit distance problem

DOI10.1556/012.2022.01517OpenAlexW4221114318MaRDI QIDQ5074693FDOQ5074693

Authors: Péter Ágoston, Dömötör Pálvölgyi 

Publication date: 9 May 2022

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.06285

Recommendations

• Unit distances
• On the approximate unit distance problem
• scientific article; zbMATH DE number 3893918
• Erdős’s Unit Distance Problem
• scientific article; zbMATH DE number 2145248

zbMATH Keywords

combinatorial geometrycrossing lemmaunit distance graphsmultigraph crossing lemmamultigraph crossing number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (1)

• On the approximate unit distance problem

This page was built for publication: An improved constant factor for the unit distance problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5074693)