The maximum number of 10- and 12-cycles in a planar graph
From MaRDI portal
Publication:2099482
Abstract: For a fixed planar graph , let denote the maximum number of copies of in an -vertex planar graph. In the case when is a cycle, the asymptotic value of is currently known for . In this note, we extend this list by establishing and . We prove this by answering the following question for , which is interesting in its own right: which probability mass on the edges of some clique maximizes the probability that independent samples from form an -cycle?
Recommendations
- Discrete Morse theory for the moduli spaces of polygonal linkages, or solitaire on a circle
- Homology of planar polygon spaces
- A perfect Morse function on planar polygon spaces
- A perfect Morse function on planar polygon spaces modulo isometry group
- On the Moduli Space of a Spherical Polygonal Linkage
Cites work
- scientific article; zbMATH DE number 3902677 (Why is no real title available?)
- Counting paths, cycles, and blow‐ups in planar graphs
- On the number of cycles of lengthk in a maximal planar graph
- The maximum number of paths of length four in a planar graph
- The maximum number of paths of length three in a planar graph
Cited in
(7)- The maximum number of copies of an even cycle in a planar graph
- A perfect Morse function on planar polygon spaces modulo isometry group
- scientific article; zbMATH DE number 1536529 (Why is no real title available?)
- The maximum number of pentagons in a planar graph
- Discrete Morse theory for the moduli spaces of polygonal linkages, or solitaire on a circle
- Planar graphs with the maximum number of induced 6-cycles
- A perfect Morse function on planar polygon spaces
This page was built for publication: The maximum number of 10- and 12-cycles in a planar graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099482)