Parking functions and labeled trees
zbMATH Open1295.05079MaRDI QIDQ658973FDOQ658973
Authors: Michel Las Vergnas, António Guedes de Oliveira
Publication date: 9 February 2012
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/SLC/wpapers/s65guedlas.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Trees (05C05) Combinatorial aspects of partitions of integers (05A17) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Other combinatorial number theory (11B75)
Cited In (14)
- Brussels sprouts, noncrossing trees, and parking functions
- On the enumeration of parking functions by leading terms
- Parking functions, empirical processes, and the width of rooted labeled trees
- Generalized parking functions, tree inversions, and multicolored graphs
- Trees, parking functions and factorizations of full cycles
- Parking functions and tree inversions revisited
- Prime parking functions on rooted trees
- Parking functions: from combinatorics to probability
- A family of bijections between \(G\)-parking functions and spanning trees
- Parking functions
- Bijections between affine hyperplane arrangements and valued graphs
- The braid and the Shi arrangements and the Pak-Stanley labelling
- \(G\)-parking functions and tree inversions
- The number of parking functions with center of a given length
This page was built for publication: Parking functions and labeled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658973)