Partial graph orientations and the Tutte polynomial

From MaRDI portal
Publication:679543

DOI10.1016/J.AAM.2017.05.003zbMATH Open1378.05093arXiv1408.3962OpenAlexW2963347042MaRDI QIDQ679543FDOQ679543


Authors: Spencer Backman Edit this on Wikidata


Publication date: 11 January 2018

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: Gessel and Sagan investigated the Tutte polynomial, T(x,y) using depth first search, and applied their techniques to show that the number of acyclic partial orientations of a graph is 2gT(3,1/2). We provide a short deletion-contraction proof of this result and demonstrate that dually, the number of strongly connected partial orientations is 2n1T(1/2,3). We then prove that the number of partial orientations modulo cycle reversals is 2gT(3,1) and the number of partial orientations modulo cut reversals is 2n1T(1,3). To prove these results, we introduce cut and cycle minimal partial orientations which provide distinguished representatives for partial orientations modulo cut and cycle reversals. These extend classes of total orientations introduced by Gioan, and Greene and Zaslavksy, and we highlight a close connection with graphic and cographic Lawrence ideals. We conclude with edge chromatic generalizations of the quantities presented, which allow for a new interpretation of the reliability polynomial for all probabilities, p with 0<p<1/2.


Full work available at URL: https://arxiv.org/abs/1408.3962




Recommendations




Cites Work


Cited In (14)





This page was built for publication: Partial graph orientations and the Tutte polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679543)