scientific article; zbMATH DE number 2209739

MaRDI QIDQ5692722zbMATH OpenFDO

Authors Radoš Radoičić, Géza Tóth

Publication date 28 September 2005

zbMATH Keywords

unit distance graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Other problems of combinatorial convexity (52A37)

Cited in

(7)

• A result in asymmetric Euclidean Ramsey theory
• On the chromatic number of \(\mathbb R^4\)
• On the chromatic number of 2-dimensional spheres
• On the chromatic number of slices without monochromatic unit arithmetic progressions
• Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions
• A lower bound on the number of colours needed to nicely colour a sphere
• On chromatic numbers of 3-dimensional slices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5692722)