On the maximum number of cycles in a pla
โ
R. E. L. Aldred; Carsten Thomassen
๐
Article
๐
2008
๐
John Wiley and Sons
๐
English
โ 142 KB
๐ 2 views
## Abstract Let __G__ be a graph on __p__ vertices with __q__ edges and let __r__โ=โ__q__โโโ__p__โ=โ1. We show that __G__ has at most ${15\over 16} 2^{r}$ cycles. We also show that if __G__ is planar, then __G__ has at most 2^__r__โโโ1^โ=โ__o__(2^__r__โโโ1^) cycles. The planar result is best possib