University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Two problems in extremal graph theory

## Two problems in extremal graph theoryAdd to your list(s) Download to your calendar using vCal - Taisa Martins (University of Warwick)
- Tuesday 28 November 2017, 15:00-16:00
- Watson LTA.
If you have a question about this talk, please contact Guillem Perarnau. In this talk, we prove a conjecture of Gyori and Tuza which states that the edges of every n-vertex graph G can be decomposed into edges and triangles C_1, . . . , C_k such that |C_1| . . . |C_k| ≤ (1/2 + o(1))n Joint work with P. Hu, D. Kral, B. Lidicky, S. Norin, Y. Pehova and J. Volec. 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 listsFilling in the blank – I will be ….... in 2050’ Computer Science Lunch Time Talk Series Jane Langdale## Other talksThe Small Mathieu Groups School Seminar Combining Organic Synthesis, Isotopes and Synthetic Biology in Natural Products Research Hydrodynamics and Chaos in Quantum Matter RSC 2019 Dalton Emerging Researcher Award Lecture RSC S F Boys-A Rahman Award Lecture |