University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Bounds for the numner of matchings in regular graphs

  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

Bounds for the numner of matchings in regular graphs

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

If you have a question about this talk, please contact Mustapha Amrani.

Combinatorics and Statistical Mechanics

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Datalog for Program Analysis: Beyond the Free Lunch Japanese Society in Cambridge ケンブリッジ日本人会 Thin Film Magnetism Group Seminars

Other talks

Speculations about homological mirror symmetry for affine hypersurfaces Managing your research data effectively and working reproducibly for beginners ‘Class-work’ in the elite institutions of higher education A physical model for wheezing in lungs Understanding mechanisms and targets of malaria immunity to advance vaccine development The Productivity Paradox: are we too busy to get anything done? The ‘Easy’ and ‘Hard’ Problems of Consciousness A new proposal for the mechanism of protein translocation Public innovation: can innovation methods help solve social challenges?
 

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