COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Combinatorics Seminar > Triangle-Intersecting Families of Graphs

## Triangle-Intersecting Families of GraphsAdd to your list(s) Download to your calendar using vCal - David Ellis (St John's College, Cambridge)
- Thursday 10 February 2011, 15:00-16:00
- MR12.
If you have a question about this talk, please contact Andrew Thomason. A family of graphs F on a fixed set of n vertices is aid to be `triangle-intersecting’ if for any two graphs G and H in F, the intersection of G and H contains a triangle. Simonovits and S\’{o}s conjectured that such a family has size at most $\frac{1}{8} 2 All will be based on joint work with Yuval Filmus (University of Toronto) and Ehud Friedgut (Hebrew University of Jerusalem). 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
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsSciScreen Cambridge POLIS Staff and PhD Student Colloquium Cambridge Classical Reception Seminar Series## Other talksIt's dangerous to go alone, take this - using Twitter for research Organoid systems to study the maternal-fetal dialogue of early pregnancy Smuts, bunts and ergots The Beginning of Our Universe and what we don't know about Physics Academic CV Workshop Athena SWAN Network Event: Changing Culture |