|
|
Межкафедральный семинар МФТИ по дискретной математике
20 апреля 2017 г. 18:30, г. Долгопрудный, Актовый зал Лабораторного корпуса МФТИ
|
 |
|
 |
|
|
|
Two-part Erdos-Ko-Rado theorems
G.O.H. Katona |
|
Аннотация:
Let G be a graph with n vertices and m edges. The maximum number of paths of length 2,3 and 4 have been determined by different authors. Now we will compare the numbers of paths of length 2 and k in a graph of n
vertices. Similar problems can be raised and considered where the paths are replaced by distances of length k.
|
|
Обратная связь: