University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Average degree and bicliques

Average degree and bicliques

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.