Planar graphs with the maximum number of induced 6-cycles

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 maximum. In particular we show that the maximum is achieved by the graph obtained by blowing up three pairwise non-adjacent ve...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-01
1. Verfasser:	Savery, Michael
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Graph theory Graphs Mathematics - Combinatorics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!