Triangle-free graphs with the maximum number of cycles
Abstract
It is shown that for n≥ 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.