Extremal graphs for two vertex-disjoint copies of a clique (Q2117533)
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: Extremal graphs for two vertex-disjoint copies of a clique |
scientific article; zbMATH DE number 7493908
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremal graphs for two vertex-disjoint copies of a clique |
scientific article; zbMATH DE number 7493908 |
Statements
Extremal graphs for two vertex-disjoint copies of a clique (English)
0 references
21 March 2022
0 references
clique
0 references
Hajnal and Szemerédi theorem
0 references
extremal graph
0 references
0.8354876637458801
0 references
0.8218437433242798
0 references
0.8199912905693054
0 references
0.8068539500236511
0 references
0.8047332763671875
0 references
