Abstract
One of the most important numerical quantities that can be computed from a graph $G$ is the two-variable Tutte polynomial. Specializations of the Tutte polynomial count various objects associated with $G$, e.g., subgraphs, spanning trees, acyclic orientations, inversions and parking functions. We show that by partitioning certain simplicial complexes related to $G$ into intervals, one can provide combinatorial demonstrations of these results. One of the primary tools for providing such a partition is depth-first search.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
