Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.12335

On a conjecture of Las Vergnas

Steven D. Noble·Gordon F. Royle
View original source ↗Read source document ↗Export metadata ↓

Abstract

In 1988, Las Vergnas conjectured that if $M$ is a binary matroid with bicycle dimension $d$, then for $0 \leq k \leq d$, the $k$th derivative of the diagonal Tutte polynomial $T(M;z,z)$ evaluated at $z=-1$ is an integer multiple of $2^{d-k}$. While this was rapidly disproved for binary matroids and for graphs in general, extensive computations strongly suggested that it might be true for planar graphs. In this paper we prove that this is indeed the case. To do this, we consider a stronger divisibility property that we call the LV property, and a larger class of graphs, namely the class of delta-wye-reducible graphs. By a detailed analysis of how a delta-wye exchange affects the coefficients of the diagonal Tutte polynomial, we show that delta-wye-reducible graphs have the LV property. That Las Vergnas' conjecture holds for planar graphs immediately follows because planar graphs are delta-wye reducible and the LV property is stronger than Las Vergnas' divisibility conditions.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Steven D. Noble, Gordon F. Royle. 2026-06-10. On a conjecture of Las Vergnas. https://arxiv.org/abs/2606.12335

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗