Hamiltonicity of graphs of acyclic orientations and acyclic polynomials

Source abstract

We study the graph $\mathcal{AO}(G)$ of acyclic orientations of a graph $G$. Two acyclic orientations are adjacent in this graph if they disagree on the orientation of a single arc. In particular, we focus on the Hamiltonicity of the graphs $\mathcal{AO}(G)$. Using two methods of pattern lacing which generalize the zig-zag method of Brenner, Cardinal, McConville, Merino and Mütze, we characterize which multipaths are $\mathcal{AO}$-Hamiltonian. Moreover, we give a criterion for the gluing of a multipath on a given graph to preserve $\mathcal{AO}$-Hamiltonicity. Building towards an inductive certification of $\mathcal{AO}$-Hamiltonicity via the (open) ear decomposition of 2-connected graphs, we propose three ways of gluing several multipaths to a given graph. In addition, we define the acyclic polynomials to encapsulate both the number of acyclic orientations of a graph and the "parity problem" proposed by Savage, Squire and West: if $-1$ is not a root of the acyclic polynomial of $G$, then $G$ is not $\mathcal{AO}$-Hamiltonian. We explore numerous properties of the acyclic polynomials, proving that they are not instances of the famous Tutte-Whitney polynomials, but that they too exhibit a partial deletion-contraction phenomenon.