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

## Hypergraph Saturation IrregularitiesAdd to your list(s) Download to your calendar using vCal - Natalie Behague (QMUL)
- Thursday 22 February 2018, 14:30-15:30
- MR12.
If you have a question about this talk, please contact Andrew Thomason. We say that a graph G is saturated with respect to some graph F if G doesn’t contain any copies of F but adding any new edge to G creates some copy of F. The saturation number sat(F,n) is the minimum number of edges an F-saturated graph on n vertices can have. This forms an interesting counterpoint to the Turan number; the saturation number is in many ways less well-behaved. For example, Tuza conjectured that sat(F,n)/n must tend to a limit as n tends to infinity and this is still open. However, Pikhurko disproved a strengthening of Tuza’s conjecture by finding a finite family of graphs, whose saturation number divided by n does not tend to a limit. We will prove a similar result for hypergraphs and discuss some variants. 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
- Interested Talks
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsChemical Engineering and Biotechnology Pembroke Papers Philomathia Forum 2017## Other talksThe microenvironment in the myeloid malignancies Genes against beans: favism, malaria and nationalism in the Middle East Designing Active Macroscopic Heat Engines CANCELED DUE TO USS PENSIONS STRIKE. White dwarfs as tracers of cosmic, galactic, stellar & planetary evolution EMERGING EPIGENETICS: DETECTING & MODIFYING EPIGENETICS MARKS |