Answers are grounded in this paper and cite their sources.
The smallest minimal degree of an r -partite graph that guarantees the existence of a complete subgraph of order r has been found for the case r = 3 by Bollobás, Erdő and Szemerédi, who also gave bounds for the cases r ≥ 4. In this paper the exact value is established for the cases r = 4 and 5, and the bounds for r ≥ 6 are improved.
No takes yet. Share an insight, caveat, or question.
Guoping Jin (1992) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: