Parking Functions And Complete Bipartite Graphs

A Parking function is a sequence of positive integers (a1; a2; : : : ; an) such that its non-decreasingrnrearrangement (b1; b2; : : : ; bn), satis es bi i, for all index i.rnIn this thesis we will see about parking functions and their interrelation with other combinatorialrnobjects; namely non-crossing partitions and labelled trees. We also discuss on therngeneralization of parking functions namely; G- parking functions and establish a new relationshiprnbetween parking functions and spanning trees of complete bipartite graphs.

Get Full Work

Report copyright infringement or plagiarism