Graph Sphericity¶
The least Euclidean dimension in which a graph can be represented as the intersection graph of congruent spheres, equivalently unit balls under the adopted convention.
Core Idea¶
Graph Sphericity is the least Euclidean dimension in which a graph can be represented as the intersection graph of congruent spheres, equivalently unit balls under the adopted convention.
Assign every graph vertex a point in R^d and fix one distance threshold, or equivalently assign congruent balls. Two vertices are adjacent exactly when their points lie within the threshold, equivalently when the corresponding balls intersect under the chosen open/closed convention. The sphericity is the smallest d for which an exact representation exists.
Scope of Application¶
The abstraction has a bounded but recurring habitat. These are literal applications of the same domain machinery, not cross-domain metaphors.
- Geometric graph representation. abstract adjacency is realized by uniform-distance proximity.
- Dimension bounds. graph classes are compared by upper and lower bounds on required Euclidean dimension.
- Intersection graph theory. congruent balls supply a tightly constrained intersection model.
- Proximity networks. the invariant asks whether a network can arise from one distance threshold in low dimension.
- Extremal graph theory. families with unusually high or low sphericity reveal limits of geometric encoding.
Clarity¶
Scale is irrelevant: any positive threshold can be rescaled to a fixed value. What matters is a single threshold for every pair and the biconditional, not merely that edges join close points. A drawing where some nonedges also lie below the threshold is not a realization.
Manages Complexity¶
Sphericity turns an open-ended geometric representation question into one integer invariant. It separates graph structure compatible with low-dimensional uniform proximity from structure requiring additional coordinates, allowing bounds to replace exhaustive search over point configurations.
The compression remains accountable because every simplification has a named validity condition. A user can ask which role is missing, which assumption fails, and which neighboring abstraction should replace the candidate instead of treating the label as an unanalyzed bundle.
Abstract Reasoning¶
R1. Fix the strict or non-strict intersection convention.
R2. Normalize the common threshold by rescaling.
R3. Verify both directions of the edge-distance biconditional.
R4. Distinguish an upper-bound construction from a proof of minimality.
R5. Use graph-class theorems only under their exact finiteness and simplicity assumptions.
The reasoning pattern is deliberately typed: definitions establish identity, calculations or constructions establish consequences, and empirical or institutional evidence establishes whether a real case instantiates the roles.
Knowledge Transfer¶
The invariant transfers literally to any finite simple graph represented by congruent Euclidean balls. Generic dimension and representation ideas travel farther, but 'sphericity' should not be used for arbitrary latent embeddings, unequal radii, or similarity scores without the exact threshold semantics.
The transfer boundary follows from the classification test: The invariant recurs across geometric graph theory and embedding problems, but adjacency-as-intersection, congruent sphere or ball convention, ambient Euclidean dimension, and minimization are constitutive.
Relationships to Other Abstractions¶
Current abstraction Graph Sphericity Domain-specific
Parents (1) — more general patterns this builds on
-
Graph Sphericity is a kind of Dimension Prime
Planarity. is a neighboring minimum-dimensional drawing property with different constraints.
Hierarchy path (1) — routes to 1 parentless root
- Graph Sphericity → Dimension
Neighborhood in Abstraction Space¶
Graph Sphericity sits in a sparse region of the domain-specific corpus (61st percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Graph Density, Distance & Planarity (11 abstractions)
Nearest neighbors
- Planarity — 0.88
- Modular product of graphs — 0.87
- Unit disk graph — 0.86
- Algebraic stack — 0.86
- Metric dimension (graph theory) — 0.86
Computed from structural-signature embeddings · 2026-09-08