Indexed metadata
Complete Subgraphs of r -partite Graphs
Guoping Jin
Source record
Source: Crossref
Published: Sep 1, 1992
DOI: 10.1017/s0963548300000274
Open original source ↗Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.