Improving an upper bound on the size of \(k\)-regular induced subgraphs (Q411262)
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 6021882
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving an upper bound on the size of \(k\)-regular induced subgraphs |
scientific article; zbMATH DE number 6021882 |
Statements
Improving an upper bound on the size of \(k\)-regular induced subgraphs (English)
0 references
4 April 2012
0 references
graphs
0 references
independent sets
0 references
induced matchings
0 references
combinatorial optimization
0 references
0.8945096731185913
0 references
0.8715469241142273
0 references
0.8670116662979126
0 references
0.8621953129768372
0 references
0.8256087899208069
0 references
