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 listsNuclear physics seminars Analysis seminar Type the title of a new list here## Other talks[Friday seminar]: Irradiated brown dwarfs in the desert Signatures of structural criticality and universality in the cellular anatomy of the brain Towards Efficient and Robust Data-Driven Optimization The percolating cluster is invisible to image recognition with deep learning Seminar [Seminar]: Two easy three-body problems |