| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777110 | Electronic Notes in Discrete Mathematics | 2017 | 7 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Nóra Frankl, Andrey Kupavskii, Konrad J. Swanepoel,