(D+1)-Colored Graphs - a Review of Sundry Properties
classification
🧮 math.CO
math-phmath.MP
keywords
graphspropertiescoloredmetricreviewalgebraiccalculationcombinatorial
read the original abstract
We review the combinatorial, topological, algebraic and metric properties supported by $(D+1)$-colored graphs, with a focus on those that are pertinent to the study of tensor model theories. We show how to extract a limiting continuum metric space from this set of graphs and detail properties of this limit through the calculation of exponents at criticality.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.