The maximum number of induced 's in a planar graph
Finding the maximum number of induced cycles of length k in a graph on n vertices has
been one of the most intriguing open problems of Extremal Graph Theory. Recently Balogh …
been one of the most intriguing open problems of Extremal Graph Theory. Recently Balogh …
Planar graphs with the maximum number of induced 6-cycles
M Savery - arXiv preprint arXiv:2110.07319, 2021 - arxiv.org
For large $ n $ we determine the maximum number of induced 6-cycles which can be
contained in a planar graph on $ n $ vertices, and we classify the graphs which achieve this …
contained in a planar graph on $ n $ vertices, and we classify the graphs which achieve this …