University of Cambridge > Talks.cam > Discrete Analysis Seminar > On the CNF complexity of graphs with no K_{2,2}'s

On the CNF complexity of graphs with no K_{2,2}'s

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

  • UserNets Hawk Katz (Indiana/Caltech)
  • ClockWednesday 31 October 2012, 16:00-17:00
  • HouseMR11, CMS.

If you have a question about this talk, please contact Ben Green.

This talk has been canceled/deleted

We disprove an old conjecture of Pudlak, Rodl, and Savicky regarding the graph complexity of bipartite graphs containing no K_{2,2}’s. We describe the significance of this conjecture and make a conjecture which is a suitable replacement.

This talk is part of the Discrete Analysis Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.

 

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