On Taylor's problem

DOI10.1007/BF02188208zbMath0844.05043arXivmath/9402213OpenAlexW1993226317MaRDI QIDQ1912691

Saharon Shelah, Péter Komjáth

Publication date: 27 August 1996

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9402213

zbMATH Keywords

chromatic graphconjecture of Taylor

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Forcing many positive polarized partition relations between a cardinal and its powerset ⋮ The chromatic number of infinite graphs - A survey

Cites Work

• What must and what need not be contained in a graph of uncountable chromatic number?
• Partition Relations Connected with the Chromatic Number of Graphs
• A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
• The Colouring Number
• On chromatic number of graphs and set-systems
• Atomic compactness and elementary equivalence

This page was built for publication: On Taylor's problem