University of Cambridge > Talks.cam > Combinatorics Seminar > Dense induced bipartite subgraphs in triangle-free graphs

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Dense induced bipartite subgraphs in triangle-free graphs

Download to your calendar using vCal

  • UserShoham Letzter (University of Cambridge)
  • ClockThursday 13 February 2020, 14:30-15:30
  • HouseMR12.

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:

Note that ex-directory lists are not shown.

Other lists

Making connections- brains and other complex systems Average on weekdays: 8930.88666667 kWh Register on Zoom - link in abstract

Other talks

FILM: One With The Whale Title to be confirmed Disentangling preventative & ejective AGN feedback on a population basis with simulations, observations & machine learning Title to be confirmed Title TBC Group Work
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity