Assorted Musings on Dimension-critical Graphs
Matt Noble

TL;DR
This paper characterizes dimension-critical complete multipartite graphs and demonstrates the existence of arbitrarily large such graphs for each dimension n, opening avenues for further research in graph dimension theory.
Contribution
It precisely identifies which complete multipartite graphs are dimension-critical and proves the existence of arbitrarily large dimension-critical graphs for each dimension n.
Findings
Complete multipartite graphs that are dimension-critical are fully characterized.
For each dimension n ≥ 2, arbitrarily large dimension-critical graphs with that dimension exist.
Abstract
For a finite simple graph , say is of dimension , and write , if is the smallest integer such that can be represented as a unit-distance graph in . Define to be \emph{dimension-critical} if every proper subgraph of has dimension less than . In this article, we determine exactly which complete multipartite graphs are dimension-critical. It is then shown that for each , there is an arbitrarily large dimension-critical graph with . We then pose and expound upon a number of questions related to this subject matter, questions that hopefully will prompt future research.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
