On 4-chromatic subgraphs of G( Q^3,d)

zbMATH Open1344.05065MaRDI QIDQ2820196FDOQ2820196

Authors: Matt Noble 

Publication date: 14 September 2016

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://ajc.maths.uq.edu.au//pdf/65/ajc_v65_p059.pdf

Recommendations

• Chromatic numbers of 3-dimensional distance graphs containing no tetrahedra
• scientific article; zbMATH DE number 1382595
• The chromatic numbers of distance graphs
• scientific article; zbMATH DE number 68356
• On the chromatic numbers of rational spaces

zbMATH Keywords

chromatic numberEuclidean distance graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Cited In (5)

• Title not available (Why is that?)
• A triangle-free, 4-chromatic \(\mathbb{Q}^3\) Euclidean distance graph Scavenger hunt!
• On single-distance graphs on the rational points in Euclidean spaces
• Isosceles triangles in \(\mathbb Q^3\)
• Chromatic numbers of 3-dimensional distance graphs containing no tetrahedra

This page was built for publication: On 4-chromatic subgraphs of \(G(\mathbb Q^3,d)\)

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