Abstract
The dimension of a graph G is the smallest d for which it can be embedded in Rd as a unit distance graph. Answering a question of Erdős and Simonovits, we show that any graph with less than (d+22) edges has dimension at most d. Improving their result, we also prove that the dimension of a graph with maximum degree d is at most d.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
