Graph Decompositions

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

• Jan Kurkofka, Birmingham
• Thursday 20 January 2022, 15:00-16:00
• LTA, additional zoom link: https://bham-ac-uk.zoom.us/j/87124623071.

If you have a question about this talk, please contact Johannes Carmesin.

Chokepoints raise challenges in numerous fields, from everyday traffic and logistics to ancient and digital military strategies. In graph theory, the global chokepoints of any graph allow us to decompose it in a tree-like way into smaller graphs by cutting at the global chokepoints. The basic instance of this idea is the block-cutvertex tree. In practice, however, chokepoints usually are not global in nature, and many graphs are not tree-like. We introduce a new method which allows us to decompose any graph into smaller graphs in an H-like way, where H is a graph simpler than G which represents the global shape of G, by cutting at the local chokepoints of G. Joint work with Carmesin, Diestel, Jacobs and Knappe.

This talk is part of the Combinatorics and Probability seminar series.

This talk is included in these lists:

• Combinatorics and Probability seminar
• LTA, additional zoom link: https://bham-ac-uk.zoom.us/j/87124623071
• School of Mathematics events

Note that ex-directory lists are not shown.