An infinite series of surfaces with known 1-chromatic number (Q1366608): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q281947 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Vladimir Petrov Kostov / rank | |||
Normal rank |
Revision as of 13:21, 12 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An infinite series of surfaces with known 1-chromatic number |
scientific article |
Statements
An infinite series of surfaces with known 1-chromatic number (English)
0 references
15 September 1997
0 references
The 1-chromatic number \(\chi_1(S)\) of a surface \(S\) is the maximum chromatic number of all graphs which can be drawn on the surface so that each edge is crossed by no more than one other edge. It is proved that if \(4n+3\) is a prime number \((n\geq 0)\) then \(\chi_1(N_{8(2n+1)^2})= R(N_{8(2n+1)^2})\), where \(R(S)=\lfloor \frac12 (9+\sqrt {81-32E(S))}\rfloor\) is Ringel's upper bound for \(\chi_1(S)\), \(E(S)\) is the Euler characteristic of \(S\) and \(N_{8(2n+1)^2}\) is the nonorientable surface of genus \(8(2n+1)^2\). By Dirichlet's theorem the arithmetic progression \(4n+3\) \((n=1,2,3,\dots)\) contains an infinite number of prime integers. As a result the first known infinite series of surfaces with known 1-chromatic number is obtained.
0 references
graph embedding
0 references
graph immersion
0 references
surface
0 references
chromatic number
0 references
genus
0 references