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

Log in

Google

Microsoft

Information on

Subscribing to talks details

Finding a talk details

Adding a talk details

Disseminating talks details

Help and Documentation details

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

Download to your calendar using vCal

Nets Hawk Katz (Indiana/Caltech)
Wednesday 31 October 2012, 16:00-17:00
MR11, 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.

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.

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

📅 Download to calendar (vCal)

⚠️ Important: This talk has been canceled/deleted

👤 Speaker: Nets Hawk Katz (Indiana/Caltech)
📅 Date & Time: Wednesday 31 October 2012, 16:00 - 17:00
📍 Venue: MR11, CMS

Questions? Contact Ben Green

Abstract

Series This talk is part of the Discrete Analysis Seminar series.

Included in Lists

This talk is not included in any other list.

Note: Ex-directory lists are not shown.

Log in

🔐 Log In

Information on

ℹ️ Information

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

This talk is included in these lists:

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

Abstract

Included in Lists

Log in

🔐 Log In

Information on

ℹ️ Information

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

This talk is included in these lists:

Other lists

Other talks

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

Abstract

Included in Lists