The Number of Large Graphs with a Positive Density of Triangles
classification
🧮 math-ph
math.COmath.MP
keywords
graphsdensitynumbertrianglespositiveboundscasecluster
read the original abstract
We give upper and lower bounds on the number of graphs of fixed degree which have a positive density of triangles. In particular, we show that there are very few such graphs, when compared to the number of graphs without this restriction. We also show that in this case the triangles seem to cluster even at low density.
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.