Skip to main content
Share Your Experience: Take the 2024 Developer Survey

New answers tagged

3 votes
Accepted

Number of graphs that almost contain a $k$-clique

It is easy to see that for $k = 2$ the only graph almost containing $k$-clique is an empty graph $nK_1$. I don't have a proof, but I guess, that $\#G(n, 3)$ is exponential. Also the number $\#G(n, 3)$ ...
Smylic's user avatar
  • 260

Top 50 recent answers are included