University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Sharp bounds for decomposing graphs into edges and triangles

## Sharp bounds for decomposing graphs into edges and trianglesAdd to your list(s) Download to your calendar using vCal - Yanitsa Pehova (University of Warwick)
- Thursday 28 March 2019, 13:00-14:00
- Watson LTB.
If you have a question about this talk, please contact Richard Montgomery. In a paper from 1966 Erdős, Goodman and Pósa showed that for every graph G of order n there exists a decomposition of the edges of G into at most n This talk is part of the Combinatorics and Probability Seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsMetamaterials Research Group Seminars Physics and Astronomy Colloquia Electromagnetic Communications and Sensing Research Seminar Series## Other talksA Bayesian multi-task regression model for detecting global microbiome associations Attacking and Defending Cloud Networks A quotient geometry on the manifold of fixed-rank positive-semidefinite matrices The Suzuki Chain School Seminar RSC 2019 Dalton Emerging Researcher Award Lecture |