University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > On the density of critical graphs without large cliques

On the density of critical graphs without large cliques

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

  • UserTom Kelly (University of Birmingham)
  • ClockThursday 31 October 2019, 14:00-15:00
  • HouseWatson LTB.

If you have a question about this talk, please contact Eoin Long.

A graph is k-critical if it has chromatic number k and every proper subgraph is (k-1)-colorable. The density of critical graphs has been extensively studied. We present an improvement on the best known lower bound for the density of critical graphs without large cliques. We also discuss a connection to a possible generalization of Reed’s Conjecture.

Joint work with Luke Postle.

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 talks.cam from the University of Cambridge.