Maximum graphs with a unique k-factor (Q790832)
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: Maximum graphs with a unique k-factor |
scientific article; zbMATH DE number 3849264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum graphs with a unique k-factor |
scientific article; zbMATH DE number 3849264 |
Statements
Maximum graphs with a unique k-factor (English)
0 references
1984
0 references
For suitable integers p and k, let f(p,k) denote the maximum number of edges in a graph of order p which has a unique k-factor. The values of f(p,k) are determined for \(k=2\), p-3 and p-2 and the extremal graphs are determined.
0 references
factors
0 references
Turan-problem
0 references
0.918962061405182
0 references
0.8936075568199158
0 references
0.8836917281150818
0 references
0.8836917281150818
0 references
