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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.