A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number

DOI10.1112/jlms/s1-35.4.445zbMath0097.16402OpenAlexW2322137037MaRDI QIDQ3276326

Richard Rado, Paul Erdős

Publication date: 1960

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s1-35.4.445

zbMATH Keywords

topology

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Continuum hypothesis and Martin's axiom (03E50)

Related Items (15)

On decomposition of graphs ⋮ Compactness and finite equivalence of infinite digraphs ⋮ A note on the Engelking-Karłowicz theorem ⋮ The chromatic number of finite type-graphs ⋮ On Taylor's problem ⋮ A note on chromatic number and connectivity of infinite graphs ⋮ Some perfect coloring properties of graphs ⋮ Shift graphs on precompact families of finite sets of natural numbers ⋮ The chromatic number of infinite graphs - A survey ⋮ Extremal triangle-free and odd-cycle-free colourings of uncountable graphs ⋮ Sets in a Euclidean space which are not a countable union of convex subsets ⋮ What must and what need not be contained in a graph of uncountable chromatic number? ⋮ Cycles in graphs of uncountable chromatic number ⋮ On chromatic number of graphs and set-systems ⋮ Zur Geometrie der Kreislagerungen

This page was built for publication: A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number