The paper gives better minimum-degree thresholds for forcing complete tripartite subgraphs and conditionally solves the Bollobas-Erdos-Szemeredi octahedron conjecture.
Erd˝ os, Unsolved problems, In Proceedings of the Conference on Combinatorial Mathematics held at the Mathematical Institute, 3-7 July 1972 (D
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2024 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree
The paper gives better minimum-degree thresholds for forcing complete tripartite subgraphs and conditionally solves the Bollobas-Erdos-Szemeredi octahedron conjecture.