University of Cambridge > Talks.cam > Junior Algebra and Number Theory seminar > One way cuts in oriented 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

One way cuts in oriented graphs

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

If you have a question about this talk, please contact Anton Evseev.

Does every oriented graph have a large subgraph consisting of edges all going in one direction? We’ll investigate combinatorial questions of this sort using simple probabilistic methods. I will give an brief introduction to probabilistic combinatorics before moving onto the results about oriented graphs, so hopefully everything should be understandable to everyone.

This talk is part of the Junior Algebra and Number Theory 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

Optimization and Incentives Seminar Collaboration Events Darwin College Lecture Series

Other talks

Direct measurements of dynamic granular compaction at the mesoscale using synchrotron X-ray radiography Imaging techniques and novel tools for early detection and intervention Athena SWAN Network Event: Changing Culture Development of machine learning based approaches for identifying new drug targets Bioengineering conference: Innovation through convergence Seminar – The Cambridge Sustainable Food Hub 'Ways of Reading, Looking, and Imagining: Contemporary Fiction and Its Optics' Protein Folding, Evolution and Interactions Symposium Validation & testing of novel therapeutic targets to treat osteosarcoma The evolution of photosynthetic efficiency Active bacterial suspensions: from individual effort to team work Bioinformatics
 

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