An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement (Q1661501)
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: An upper bound on the number of edges of a graph whose kth power has a connected complement |
scientific article; zbMATH DE number 6919673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement |
scientific article; zbMATH DE number 6919673 |
Statements
An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement (English)
0 references
16 August 2018
0 references
0.786436140537262
0 references
0.7568675875663757
0 references
0.7559346556663513
0 references
0.7371755838394165
0 references
