Bounding the fractional chromatic number of \(K_\Delta\)-free graphs (Q2848565)
From MaRDI portal
!
WARNING
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 6212031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the fractional chromatic number of \(K_\Delta\)-free graphs |
scientific article; zbMATH DE number 6212031 |
Statements
26 September 2013
0 references
fractional coloring
0 references
graph coloring
0 references
fractional chromatic number
0 references
Reed's conjecture
0 references
Bounding the fractional chromatic number of \(K_\Delta\)-free graphs (English)
0 references
0.8167698383331299
0 references
0.8140585422515869
0 references
0.8120602369308472
0 references
0.8026936054229736
0 references
0.8010168671607971
0 references
