Easier proofs of coloring theorems
The author presents a simpler proof of the theorem [due to \textit{E. K. van Douwen}, \textit{J. M. Aarts}, \textit{R. J. Fokkink}, \textit{J. Vermeer}, and \textit{M. A. van Hartskamp}] that a fixed-point free homeomorphism on an \(n\)-dimensional paracompact space can be colored with \(n+3\) colors. Here, a coloring is defined as follows: If \(f:X\to X\) is a fixed-point free continuous function, then a coloring of \(f\) is a finite closed cover \({\mathcal U}\) of \(X\) such that \(U\cap f[U]=\emptyset\) for every \(U\in{\mathcal U}\). An example is given (in the topological countable sum of closed unit intervals) to show that for \(n>0\) the result does not follow for the more general case in which \(f\) is merely continuous.
- Short proofs of the Kneser-Lovász coloring principle
- Intersection properties for coverings of \(G\)-spaces
- Eventual colorings of homeomorphisms
- Fixed-point free maps on the reals and more
- An addition theorem for the color number
- The colorings of homeomorphisms on connected graphs
- scientific article; zbMATH DE number 1498614 (Why is no real title available?)
- scientific article; zbMATH DE number 1567760 (Why is no real title available?)
- Lusternik-Schnirelman for subspaces
- Continuous colouring of closed graphs
This page was built for publication: Easier proofs of coloring theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807552)
