Dense induced bipartite subgraphs in triangle-free graphs

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

• Shoham Letzter (University of Cambridge)
• Thursday 13 February 2020, 14:30-15:30
• MR12.

If you have a question about this talk, please contact Andrew Thomason.

Erdős, Faudree, Pach and Spencer (1988) introduced the problem of searching for large induced bipartite subgraphs in triangle-free graphs. We consider a variant of this problem, where the objective is to find induced bipartite subgraphs with large minimum degree. Specifically, we prove that every triangle-free graph with minimum degree d contains an induced bipartite graph with minimum degree at least c*log(d)/log(log(d)), thus nearly confirming a conjecture of Esperet, Kang and Thomassé.

This is joint work with Matthew Kwan, Benny Sudakov and Tuan Tran.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.