The size of a minimum five-chromatic \(K_ 4\)-free graph (Q1313876): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Small graphs with chromatic number 5: A computer search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3338272 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3035305 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)90309-h / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2043684617 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:02, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The size of a minimum five-chromatic \(K_ 4\)-free graph |
scientific article |
Statements
The size of a minimum five-chromatic \(K_ 4\)-free graph (English)
0 references
6 June 1994
0 references
The minimum number of vertices in a five-chromatic graph that does not contain \(K_ 4\) is determined. \textit{N. D. Nenov} [C. R. Acad. Bulg. Sci. 37, 301-304 (1984; Zbl 0547.05030)] has shown that the chromatic number of any ten-vertex graph without \(K_ 4\) is at most four. A well-known construction of Mycielski leads to the Grötzsch graph, an eleven- vertex, four-chromatic, triangle-free graph. Adding a new vertex adjacent to all the vertices of the Grötzsch graph creates a twelve-vertex, five-chromatic graph, not containing \(K_ 4\). Thus the minimum number of vertices in a five-chromatic, \(K_ 4\)-free graph is either eleven or twelve. We show that the correct answer is eleven by describing two examples.
0 references
five-chromatic graph
0 references
chromatic number
0 references
Grötzsch graph
0 references