The Erdős–Faber–Lovász conjecture (posed in 1972) states that the chromatic index of any linear hypergraph on n vertices is at most n. In this talk, I will sketch a proof of this conjecture for every large n. Joint work with D. Kang, T. Kelly, D. Kühn and D. Osthus.
Seminars and Colloquiums
Calendar of Events
S
Sun
|
M
Mon
|
T
Tue
|
W
Wed
|
T
Thu
|
F
Fri
|
S
Sat
|
---|---|---|---|---|---|---|
0 events,
|
0 events,
|
1 event,
-
|
1 event,
-
We show that there is no |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
Hadwiger's famous coloring conjecture states that every t-chromatic graph contains a |
1 event,
-
A circle graph is an intersection graph of a set of chords of a circle. In this talk, I will describe the unavoidable induced subgraphs of circle graphs with large treewidth. This includes examples that are far from the `usual suspects'. Our results imply that treewidth and Hadwiger number are linearly tied on the class … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
We show fixed-parameter tractability of the Directed Multicut problem with three terminal pairs (with a randomized algorithm). This problem, given a directed graph |
1 event,
-
Let |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
Let |
0 events,
|
0 events,
|
0 events,
|
0 events,
|