Microsoft Research330 тыс
Следующее
Опубликовано 6 сентября 2016, 5:34
We prove an old conjecture of Erdos, saying that Menger's theorem is valid also for infinite graphs, in the following strong form: given sets A and B of vertices in a graph (possibly directed, possibly infinite), there exists a family P of disjoint A-B paths, and an A-B separating set S, such that S consists of a choice of precisely one vertex from each path in P. The talk will describe the history of the problem and the main ideas of our proof. This is joint work with Ron Aharoni.
Свежие видео
Use rich text formatting in #GoogleChat to highlight important details in team discussions 💬 #Shorts
Случайные видео