Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number (Q690542)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6110739
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number |
scientific article; zbMATH DE number 6110739 |
Statements
Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number (English)
0 references
28 November 2012
0 references
independent sets
0 references
induced matchings
0 references
0 references
0.8945096731185913
0 references
0.8814042806625366
0 references
0.8458834886550903
0 references
0.833560585975647
0 references
0.8130341172218323
0 references
