The Maximum Number of Pentagons in a Planar Graph

30 Sep 2019 Győri Ervin Paulos Addisu Salia Nika Tompkins Casey Zamora Oscar

Hakimi and Schmeichel considered the problem of maximizing the number of cycles of a given length in an $n$-vertex planar graph. They determined this number exactly for triangles and 4-cycles and conjectured the solution to the problem for 5-cycles... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS