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

From MaRDI portal
Publication:2099482




Abstract: For a fixed planar graph H, let operatornamemathbfNmathcalP(n,H) denote the maximum number of copies of H in an n-vertex planar graph. In the case when H is a cycle, the asymptotic value of operatornamemathbfNmathcalP(n,Cm) is currently known for min3,4,5,6,8. In this note, we extend this list by establishing operatornamemathbfNmathcalP(n,C10)sim(n/5)5 and operatornamemathbfNmathcalP(n,C12)sim(n/6)6. We prove this by answering the following question for min5,6, which is interesting in its own right: which probability mass mu on the edges of some clique maximizes the probability that m independent samples from mu form an m-cycle?









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)