1
Frankl–Kupavskii–Swanepoel Theorem 3: fewer than \(\binom {d+2}{2}\) edges embeds in \(\mathbb {R}^d\)
▶
1.1
Notation
1.2
From the library
1.3
Spherical placements
1.4
Maximum degree \(d - 1\): FKS Proposition 2
1.5
Placements in \(\mathbb {R}^d\) off the sphere
1.6
The induction, with the budget as a parameter
1.7
Frankl–Kupavskii–Swanepoel, Theorem 3
Dependency graph
Frankl–Kupavskii–Swanepoel Theorem 3: fewer than \(\binom {d+2}{2}\) edges embeds in \(\mathbb {R}^d\)
Dishant Shah
1
Frankl–Kupavskii–Swanepoel Theorem 3: fewer than \(\binom {d+2}{2}\) edges embeds in \(\mathbb {R}^d\)
1.1
Notation
1.2
From the library
1.3
Spherical placements
1.4
Maximum degree \(d - 1\): FKS Proposition 2
1.5
Placements in \(\mathbb {R}^d\) off the sphere
1.6
The induction, with the budget as a parameter
1.7
Frankl–Kupavskii–Swanepoel, Theorem 3