The chromatic number of the plane is at least 5: a new proof (Q2189746): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q128545239, #quickstatements; #temporary_batch_1723667127323 |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963183679 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1805.00157 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The fractional chromatic number of the plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The chromatic number of the plane is at least 5 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2979784 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5837312 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing Small Unit-Distance Graphs with Chromatic Number 5 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Mathematical Coloring Book / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q128545239 / rank | |||
Normal rank |
Revision as of 21:40, 14 August 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The chromatic number of the plane is at least 5: a new proof |
scientific article |
Statements
The chromatic number of the plane is at least 5: a new proof (English)
0 references
16 June 2020
0 references
\textit{A. D. N. J. de Grey} [Geombinatorics 28, No. 1, 18--31 (2018; Zbl 1404.05063)] used a graph with 1581 vertices to show that the chromatic number of the plane is at least five. The lower bound, as exhibited by the Moser spindle, had been at four since 1961 [\textit{L. Moser} and \textit{W. Moser}, ``Solution to problem 10'', Can. Math. Bull. 4, 187--189 (1961)]. The present paper uses a graph with 627 vertices to achieve the same lower bound of five.
0 references
graph coloring
0 references
chromatic number of the plane
0 references