University of Cambridge > Talks.cam > Combinatorics Seminar > Proof of the 1-factorization and Hamilton decomposition conjectures

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

Proof of the 1-factorization and Hamilton decomposition conjectures

Add to your list(s) Download to your calendar using vCal

  • UserAllan Lo (University of Birmingham)
  • ClockThursday 07 February 2013, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

Abstract not available

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Faith and Peace IEEE (Institute of Electrical and Electronics Engineers) Talks ‘Diglossia, Bidialectalism, or Bilingualism? Portuguese as a Foreign Language in the Classroom’ Cambridge University Commonwealth Society The Cambridge Group for the History of Population and Social Structure - seminar series Vision Science Journal Club

Other talks

Propagation of Very Low Frequency Emissions from Lightning Computer vision techniques for measuring deformation Graph Convolutional Networks for Natural Language Processing and Relational Modeling Athena SWAN Network Event: Changing Culture Transcriptional control of pluripotent stem cell fate by the Nucleosome Remodelling and Deacetylation (NuRD) complex The Digital Doctor: Hope, Hype, and Harm at the Dawn of Medicine’s Computer Age Cyclic Peptides: Building Blocks for Supramolecular Designs Dynamics of Phenotypic and Genomic Evolution in a Long-Term Experiment with E. coli Are hospital admissions for people with palliative care needs avoidable and unwanted? 'Ways of Reading, Looking, and Imagining: Contemporary Fiction and Its Optics' South American Opuntioids
 

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