Average degree and bicliques

Add to your list(s) Download to your calendar using vCal

• Rose McCarty, Waterloo
• Thursday 04 November 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.

When is the maximum average degree of a graph tied to the size of its largest balanced biclique? It turns out that we just need to forbid induced 4-cycle-free subgraphs of large average degree. But can we use this approach to find an efficient relationship? This talk will be informal and focused on open problems.

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.