A 4-dimensional graph has at least 9 edges

DOI10.1016/j.disc.2013.05.005zbMath1277.05088OpenAlexW2013894466MaRDI QIDQ385728

Roger F. House

Publication date: 3 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.05.005

zbMATH Keywords

graph dimensionopen problem of Paul Erdős

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (3)

A dimension 6 graph with minimum edge-set ⋮ Embedding graphs in Euclidean space ⋮ Embedding graphs in Euclidean space

Cites Work

• The Mathematical Coloring Book
• On the dimension of a graph
• Unnamed Item

This page was built for publication: A 4-dimensional graph has at least 9 edges