SEMINAR: Groups and Combinatorics Seminar, The Merino Welsh Conjecture
|
|
Groups and Combinatorics Seminar, The Merino Welsh Conjecture |
Other events...
|
Abstract:
Merino and Welsh conjectured that for any loopless bridgeless graph, the number of spanning trees is dominated either by the number of acyclic orientations of the graph, or by the number of totally cyclic orientations of the graph.
In this talk, I will discuss this conjecture and the partial results that have been previously obtained, along with a proof (which is joint work with Steve Noble) that the conjecture is true for series-parallel graphs.
Speaker(s) |
Gordon Royle (UWA)
|
Location |
Blakers Lecture Theatre
|
|
Contact |
Irene Pivotto
<[email protected]>
|
Start |
Fri, 07 Jun 2013 15:00
|
End |
Fri, 07 Jun 2013 16:00
|
Submitted by |
Irene Pivotto <[email protected]>
|
Last Updated |
Fri, 07 Jun 2013 12:16
|
Included in the following Calendars: |
|
- Locations of venues on the Crawley and Nedlands campuses are
available via the Campus Maps website.
- Download this event as:
Text |
iCalendar
-
Mail this event:
|