![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Wednesday 13 February 2008, 14:00-15:00
One way cuts in oriented graphs
- đ¤ Speaker: Simon Griffiths
- đ Date & Time: Wednesday 13 February 2008, 14:00 - 15:00
- đ Venue: MR4, CMS, Wilberforce Road, Cambridge, CB3 0WB
Questions? Contact
Anton Evseev
Abstract
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.
Series This talk is part of the Junior Algebra and Number Theory seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- CMS Events
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Hanchen DaDaDash
- Interested Talks
- Junior Algebra and Number Theory seminar
- MR4, CMS, Wilberforce Road, Cambridge, CB3 0WB
- ndb35's list
- School of Physical Sciences
Note: Ex-directory lists are not shown.