Counting cliques in $1$-planar graphs

J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku +2

The problem of maximising the number of cliques among $n$-vertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of…