Planar graphs with the maximum number of induced 6-cycles

DOI10.37236/11944arXiv2110.07319OpenAlexW3206644190MaRDI QIDQ6197310

Unnamed Author

Publication date: 16 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.07319

zbMATH Keywords

\(n\)-vertex planar graphsflap-number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• The inducibility of blow-up graphs
• A note on the inducibility of 4-vertex graphs
• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• On the maximum number of cliques in a graph
• The inducibility of graphs
• A bound on the inducibility of cycles
• The maximum number of 10- and 12-cycles in a planar graph
• On the exact maximum induced density of almost all graphs and their inducibility
• The maximum number of paths of length four in a planar graph
• Generalized planar Turán numbers
• Graph Theory
• On the frequency of 3-connected subgraphs of planar graphs
• On the number of cycles of length 4 in a maximal planar graph
• On the number of cycles of lengthk in a maximal planar graph
• Connectivity, graph minors, and subgraph multiplicity
• Subgraph densities in a surface
• The maximum number of paths of length three in a planar graph
• Counting paths, cycles, and blow‐ups in planar graphs
• The maximum number of induced C5's in a planar graph

This page was built for publication: Planar graphs with the maximum number of induced 6-cycles