The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (Q998415)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Unfortunately, we do not yet have an article page for this item.
scientific article; zbMATH DE number 5499811
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) |
scientific article; zbMATH DE number 5499811 |
Statements
The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (English)
0 references
28 January 2009
0 references
list coloring
0 references
triangle-free graph
0 references
the Grötzsch graph
0 references
0.8102675676345825
0 references
0.8092364072799683
0 references
0.7852312922477722
0 references
0.7771074771881104
0 references
