A dimension 6 graph with minimum edge-set

DOI10.1007/s00373-017-1854-8zbMath1380.05136OpenAlexW2765657119MaRDI QIDQ1696543

Matt Noble, Joe Chaffee

Publication date: 14 February 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1854-8

zbMATH Keywords

matchingsgraph dimensionunit-distance graph representations

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Embedding graphs in Euclidean space

Cites Work

• A 4-dimensional graph has at least 9 edges
• Degree sequences and the existence of \(k\)-factors
• The Mathematical Coloring Book
• On the dimension of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A dimension 6 graph with minimum edge-set