1
Dimension five graphs with fifteen edges
▶
1.1
Definitions
1.2
From the library
1.3
Theorem 8: \(\dim K_{1,3,3} = 5\)
1.4
Lemma 9: the cocktail-party graphs
1.5
Theorem 10: at most fourteen edges is representable in \(\mathbb {R}^4\)
1.6
The targets
Dependency graph
Erdős 1007, dimension five: fifteen edges, attained by K6 and K1,3,3
Dishant Shah
1
Dimension five graphs with fifteen edges
1.1
Definitions
1.2
From the library
1.3
Theorem 8: \(\dim K_{1,3,3} = 5\)
1.4
Lemma 9: the cocktail-party graphs
1.5
Theorem 10: at most fourteen edges is representable in \(\mathbb {R}^4\)
1.6
The targets