The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree (Q912124)
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: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree |
scientific article; zbMATH DE number 4144013
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree |
scientific article; zbMATH DE number 4144013 |
Statements
The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree (English)
0 references
1990
0 references
The graph G with maximum degree D does not contain an independent pair of edges as an induced subgraph. The authors prove the following: G has at most \(5D^ 2/4\) edges if D is even. If D is odd, this bound can be improved to \((5D^ 2-2D+1)/4\). The extremal graphs are unique.
0 references
maximum degree
0 references
extremal graphs
0 references
