Triangle-free graphs with the maximum number of cycles
classification
🧮 math.CO
keywords
triangle-freecyclesgraphgraphsnumbercompleteequibipartitegreatest
read the original abstract
It is shown that for $n\geq 141$, among all triangle-free graphs on $n$ vertices, the complete equibipartite graph is the unique triangle-free graph with the greatest number of cycles.
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.