The maximum number of 10- and 12-cycles in a planar graph

DOI10.1016/j.disc.2022.113245zbMath1504.05139arXiv2106.02966OpenAlexW3167937992MaRDI QIDQ2099482

Yanyan Li

Publication date: 23 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

planar graphsmaximum likelihood estimatorsgeneralized Turán problems

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)

Related Items (1)

Planar graphs with the maximum number of induced 6-cycles

Cites Work

• The maximum number of paths of length four in a planar graph
• On the number of cycles of lengthk in a maximal planar graph
• The maximum number of paths of length three in a planar graph
• Counting paths, cycles, and blow‐ups in planar graphs
• Unnamed Item

This page was built for publication: The maximum number of 10- and 12-cycles in a planar graph