Spanning trees in complete uniform hypergraphs and a connection to extended r-Shi hyperplane arrangements

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We give a Cayley type formula to count the number of spanning trees in the complete r-uniform hypergraph for all r >= 3. Similar to the bijection between spanning trees in complete graphs and Parking functions, we derive a bijection from spanning trees of the complete (r+1)-uniform hypergraph which arise from a fixed r-perfect matching and r-Parking functions. We observe a simple consequence of this bijection in terms of the number of regions of the extended Shi arrangement.
11 pages, 5 figures, corrected scores of errors, added a section on gen fns

Keywords

Combinatorics, 05A15

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/112640

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0605083
 http://arxiv.org/abs/math/0605083

Collections

arXiv