Spanning trees in complete uniform hypergraphs and a connection to extended r-Shi hyperplane arrangements
| dc.creator | Sivasubramanian, Sivaramakrishnan | |
| dc.date | 2006-05-03 | |
| dc.date | 2006-05-12 | |
| dc.date.accessioned | 2026-07-07T07:13:52Z | |
| dc.date.available | 2026-07-07T07:13:52Z | |
| dc.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. | |
| dc.description | 11 pages, 5 figures, corrected scores of errors, added a section on gen fns | |
| dc.identifier | https://arxiv.org/abs/math/0605083 | |
| dc.identifier | http://arxiv.org/abs/math/0605083 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/112640 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15 | |
| dc.title | Spanning trees in complete uniform hypergraphs and a connection to extended r-Shi hyperplane arrangements | |
| dc.type | text |