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 > Fractional decompositions of dense graphs

## Fractional decompositions of dense graphsAdd to your list(s) Download to your calendar using vCal - Richard Montgomery (University of Cambridge)
- Thursday 09 November 2017, 14:30-15:30
- MR12.
If you have a question about this talk, please contact Andrew Thomason. It is difficult to determine when a graph G can be edge-covered by edge-disjoint copies of a fixed graph F. That is, when it has an F-decomposition. However, subject to some simple divisibility conditions, a high minimum degree is known to force such a decomposition in large graphs. Recent research has strongly linked reducing the degree bound required here to comparable results for a relaxation of this problem, where a fractional decomposition is sought. I will show how a relatively simple random process can give a good starting approximation to a fractional decomposition, and how it subsequently can be corrected. This improves the best known bounds until the permitted discrepancy in degree is within a constant factor of the conjectured maximum. 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
Note that ex-directory lists are not shown. |
## Other listsEnterprise Tuesday 2012/2013 Topology Seminar The Ellen McArthur Lectures 2013## Other talksThe Fyodorov-Bouchaud conjecture and Liouville conformal field theory Dr. John Briggs - Title to be Confirmed Prof. David Christianson - Title to be Confirmed Proton Structure from the MMHT viewpoint G I TAYLOR LECTURE - Waves in the airways: a carpet of microscopic rowers keeps us alive Hamilton spheres in 3-uniform hypergraphs |