Complete subgraphs in multipartite graphs (Q2392040)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complete subgraphs in multipartite graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complete subgraphs in multipartite graphs |
scientific article |
Statements
Complete subgraphs in multipartite graphs (English)
0 references
6 August 2013
0 references
For large \(l\), the author finds the minimal edge density \(d(k,l)\) such that every \(l\)-partite graph whose parts have pairwise edge density greater than \(d(k,l)\) contains a \(k\)-complete graph. The structure of the extremal graphs is also described.
0 references
extremal graphs
0 references
multipartite graphs
0 references
edge density
0 references
0.9946784
0 references
0.9521519
0 references
0.94914675
0 references
0 references
0 references
0.93103683
0 references
0.92876625
0 references
0 references
0 references
