# #StackBounty: #graphs #reference-request #clique Number of maximal cliques in a (\$C_5\$, \$P_5\$)-free graph

### Bounty: 50

So far, I have found out that chordal graphs have linear number of maximal cliques with respect to the number of vertices.
In general, it is exponential.

I am trying to determine whether the number of maximal cliques in a $$(C_5,P_5)$$-free graph with respect to the number of vertices.

In a $$(C_5,P_5)$$-free graph, the largest induced cycle is of length 4.

Is there a paper that mentions such result?

Get this bounty!!!

This site uses Akismet to reduce spam. Learn how your comment data is processed.