Triangle-free graphs with the maximum number of cycles
Combinatorics
2015-03-24 v2
Abstract
It is shown that for , among all triangle-free graphs on vertices, the complete equibipartite graph is the unique triangle-free graph with the greatest number of cycles.
Cite
@article{arxiv.1501.01088,
title = {Triangle-free graphs with the maximum number of cycles},
author = {Andrii Arman and David S. Gunderson and Sergei Tsaturian},
journal= {arXiv preprint arXiv:1501.01088},
year = {2015}
}