Asymptotic Sharpness of Bounds on Hypertrees
The hypertree can be defined in many different ways. Katona and Szabó introduced a new, natural definition of hypertrees in uniform hypergraphs and investigated bounds on the number of edges of the hypertrees. They showed that a k-uniform hypertree on n vertices has at most (nk−1)$\left( {\matrix{n...
Сохранить в:
| Главные авторы: | , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
University of Zielona Góra
2017-08-01
|
| Серии: | Discussiones Mathematicae Graph Theory |
| Предметы: | |
| Online-ссылка: | https://doi.org/10.7151/dmgt.1947 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|