University of Cambridge > Talks.cam > Combinatorics Seminar > Fractional decompositions of dense graphs

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Fractional decompositions of dense graphs

Download to your calendar using vCal

  • UserRichard Montgomery (University of Cambridge)
  • ClockThursday 09 November 2017, 14:30-15:30
  • HouseMR12.

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:

Note that ex-directory lists are not shown.

Other lists

DAMTP Astrophysics Seminars Webinar & LT2, Computer Laboratory, William Gates Building. I.4 Seminar Room, Corpus Christi College

Other talks

Title to be confirmed Theophilus Richmond’s The First Crossing: The Transition from Slavery to Indentureship in the Caribbean and the Case of the Black Slave on the Hesperus John Kendrew Lecture - Title TBC Machine Learning for Spectral Geometry and Vice Versa Kirk Public Lecture: Title TBC TBC
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity