University of Cambridge > > Junior Algebra and Number Theory seminar > One way cuts in oriented graphs

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.


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