| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6423406 | Discrete Mathematics | 2013 | 7 Pages |
Abstract
The open problem posed by Paul ErdÅs asking for the smallest number of edges in a 4-dimensional graph is solved by showing that a 4-dimensional graph must have at least 9 edges. Furthermore, there is only one 4-dimensional graph with 9 edges, namely K3,3.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Roger F. House,