Regular Graphs with Many Triangles are Structured
<jats:p>We compute the leading asymptotics of the logarithm of the number of $d$-regular graphs having at least a fixed positive fraction $c$ of the maximum possible number of triangles, and provide a strong structural description of almost all such graphs.
 When $d$ is constant, we...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
The Electronic Journal of Combinatorics
2022
|
| Online Access: | https://hdl.handle.net/1721.1/145810 |