Odd subgraphs are odd
26th October 2021, 4:00 pm – 5:00 pm
Virtual (online) Zoom seminar; a link will be sent to the Bristol Combinatorics Seminar mailing list, the day before the seminar.
In this talk we discuss some problems related to finding large
induced subgraphs of a given graph G with some degree-constraints (for
example, all degrees are odd, or all degrees are j mod k, etc). We
survey some classical results, present some intersting and challenging
problems, and sketch solutions to some of them.
This is based on joint works with Michael Krivelevich, and with Liam
Hardiman and Michael Krivelevich.