University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Counting cliques in 1-planar graphs

## Counting cliques in 1-planar graphsAdd to your list(s) Download to your calendar using vCal - Pascal Gollin, IBS Korea
- Thursday 28 October 2021, 15:00-16:00
- https://bham-ac-uk.zoom.us/j/87124623071.
If you have a question about this talk, please contact Johannes Carmesin. 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, i.e. graphs that can be drawn in the plane in such a way that each edge crosses at most 1 other edge, 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. This is joint work with Kevin Hendrey, Abhishek Methuku, Casey Tompkins and Xin Zhang. This talk is part of the Combinatorics and Probability Seminar series. ## This talk is included in these lists:- Combinatorics and Probability Seminar
- School of Mathematics Events
- https://bham-ac-uk.zoom.us/j/87124623071
Note that ex-directory lists are not shown. |
## Other listsPhysics and Astronomy Colloquia Theoretical computer science seminar Nanoscale Physics Seminars## Other talksTitle tbc TBA Two structure-preserving time discretizations for gradient flow. An application to GENERIC systems Explainable Multiview Learning for Environmental Multiomics Modelling Differentiability of typical Lipschitz functions The increasing complexity of Dark Matter searches in ATLAS |