Title of article
A 4-dimensional graph has at least 9 edges
Author/Authors
House، نويسنده , , Roger F.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
7
From page
1783
To page
1789
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 K 3 , 3 .
Keywords
Graph dimension , Open problem of Paul Erd?s
Journal title
Discrete Mathematics
Serial Year
2013
Journal title
Discrete Mathematics
Record number
1600394
Link To Document