Genus Polynomials of Cubic Graphs with Non-Real Roots

MaRDI QIDQ6421054zbMATH OpenFDO

Authors MacKenzie Carr, Varpreet Dhaliwal, Bojan Mohar

Publication date 19 December 2022

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10) Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15)

Abstract: Given a graph $G$, its genus polynomial is $Gamm{a}_G(x)=su{m}_{kgeq0}{g}_k(G)x^k$, where $g_k(G)$ is the number of 2-cell embeddings of $G$ in an orientable surface of genus $k$. The Log-Concavity Genus Distribution (LCGD) Conjecture states that the genus polynomial of every graph is log-concave. It was further conjectured by Stahl that the genus polynomial of every graph has only real roots, however this was later disproved. We identify several examples of cubic graphs whose genus polynomials, in addition to having at least one non-real root, have a quadratic factor that is non-log-concave when factored over the real numbers.

This page was built for publication: Genus Polynomials of Cubic Graphs with Non-Real Roots

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