The maximum number of induced C5's in a planar graph

DOI10.1002/jgt.22745zbMath1522.05206arXiv2004.01162OpenAlexW3204672481MaRDI QIDQ6057646

Debarun Ghosh, Oscar Zamora, Addisu Paulos, Oliver Janzer, Ervin Gyoeri, Nika Salia

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

planar graphsinduced subgraph5-cycle

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) Distance in graphs (05C12)

Related Items (1)

Planar graphs with the maximum number of induced 6-cycles

Cites Work

• Unnamed Item
• 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
• The maximal number of induced complete bipartite graphs
• The maximal number of induced \(r\)-partite subgraphs
• Maximising the number of induced cycles in a graph
• On the Minimal Density of Triangles in Graphs
• On the number of cycles of lengthk in a maximal planar graph
• The inducibility of complete bipartite graphs
• The Inducibility of Graphs on Four Vertices

This page was built for publication: The maximum number of induced C5's in a planar graph