2021/09/07 by J. Pascal Gollin, Kevin Hendrey, Gollin, J. Pascal +7
Computer Science · Mathematics · #05C10 #05C35 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Optimization and Search Problems
paper · pdf · doi:10.48550/arxiv.2109.02906
openalex publication_date 2021/09/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 1-planar graphs where we determine precisely the maximum total number of cliques as well as the maximum number of cliques of any fixed size. We also precisely characterise the extremal graphs for these problems.