Let \(n\) be a natural number and \(P(n)\) be the following statement: If all finite subgraphs of a graph \(G\) are \(n\)-colorable, then \(G\) is \(n\)-colorable. From results of \textit{J. Mycielsky} [Acta Math. Acad. Sci. Hung. 12, 125--129 (1961; Zbl 0100.19404)] and \textit{H. Läuchli} [Isr. J. Math. 9, 422--429 (1971; Zbl 0261.04002)] it follows that \(P(m) \leftrightarrow P(n)\) for all \(m,n \geq 3\). The result heavily relies on the Boolean prime ideal theorem, and Läuchli stated the problem to give a ``direct proof for \(P(3) \rightarrow P(4)\). The paper under review solves this problem, i.e. it proves that \(P(3) \rightarrow P(4)\) without using the Boolean prime ideal theorem.
- On a theorem of Laurent Schwartz
- scientific article; zbMATH DE number 25171
- scientific article; zbMATH DE number 3318580
- On a theorem of Hochstadt
- On a Theorem of Gundersen and Laine.
- scientific article; zbMATH DE number 1110477
- On the Leray-Hirsch theorem
- On Lau's conjecture
- On a theorem of Lyusternik
- scientific article; zbMATH DE number 3037241
- scientific article; zbMATH DE number 1221843 (Why is no real title available?)
- scientific article; zbMATH DE number 1885963 (Why is no real title available?)
- scientific article; zbMATH DE number 2113454 (Why is no real title available?)
- On Lau’s conjecture II
- scientific article; zbMATH DE number 3318580 (Why is no real title available?)
- A Remark on the Proof of a Theorem of Laufer and Tomber
This page was built for publication: On a theorem of Hans Läuchli
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679674)
