Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2406.05509

TAR reconfiguration for vertex set parameters

Bryan A. Curtis·Mary Flagg·Leslie Hogben
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper surveys results about token addition and removal (TAR) reconfiguration for several well-known vertex set parameters including domination, power domination, standard zero forcing, and PSD zero forcing. We also expand the range of parameters to which universal $X$-set TAR graph results apply, for $X$-sets and their TAR graphs introduced in [B. Bjorkman, C. Bozeman, D. Ferrero, M. Flagg, C. Grood, L. Hogben, B. Jacob, C. Reinhart, Power domination reconfiguration, arXiv:2201.01798] and [N.H. Bong, J. Carlson, B. Curtis, R. Haas, L. Hogben, Isomorphisms and properties of TAR reconfiguration graphs for zero forcing and other $X$-set parameters, \emph{Graphs Combin.} {39} (2023), Paper No. 86]. Here we examine which of the $X$-set axioms are needed for which results. The main results apply to skew zero forcing and vertex covering, and results about TAR reconfiguration graphs of these parameters are presented. While $X$-sets are defined for parameters that take the minimum cardinality over the $X$-sets of a graph, and $X$-set results are restricted to such minimizing parameters, our expansion of the universal perspective allows these results to be applied to parameters that take the maximum value among relevant sets, called $Y$-sets. Maximizing parameters to which the main results apply include independence number, (upper) irredundance number, and (upper) zero forcing irredundance number, and failed zero forcing number; TAR reconfiguration results are presented for these parameters. We also show that the equivalence of connectedness in certain token jumping reconfiguration graphs and certain TAR reconfiguration graphs for independent sets established in [M. Kami\'nski, P. Medvedev, M. Milani\v c. Complexity of independent set reconfiguration problems. {\em J. Theoretical Computer Science} 439 (2012), 9--15.] extends to $X$-set and $Y$-set parameters.

Explore related subjects

math.CO

Keep this discovery

BibTeXRIS

Bryan A. Curtis, Mary Flagg, Leslie Hogben. 2024-06-08. TAR reconfiguration for vertex set parameters. https://arxiv.org/abs/2406.05509

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

KEEP EXPLORING

Related papers

arXiv2026

Balanced even cycles in signed graphs:Tur\'an bounds, double covers, and parity obstructions

We study Tur\'an problems for balanced even cycles in simple signed graphs, where signed subgraphs are considered up to switching. For every balanced bipartite signed graph, the signed and ordinary Tur\'an numbers differ by at most a factor of two. Our main structural results concern the underlying graphs that admit a signing in which every $2k$-cycle is unbalanced. We characterize these graphs by the absence of an odd dependence among their $2k$-cycle incidence vectors, give a cohomological formulation, and construct subgraph-minimal obstructions of arbitrarily large order. In particular, there is no finite forbidden-subgraph characterization. We also give an exact closed-walk criterion for cycles in double covers and derive a direct signed breadth-first-search upper bound. As applications, we prove \[ \hex(n,C_{+4})=\left(\frac{\sqrt2}{2}+o(1)\right)n^{3/2} \] and study the signed hexagon number $R_6(n)=\hex(n,\{C_{-3},C_{+6}\})$. We characterize the underlying graphs counted by $R_6$ and express it as an extremal problem for ordinary $C_6$-free graphs with a prescribed involution. For every sufficiently large $n$, we construct examples with $\Omega(n^{4/3})$ edges, and we give an equivariant construction attaining the coefficient obtained from the F\"uredi--Naor--Verstra\"ete lower bound by double-cover transfer. Finally, we give $n$-vertex $C_{+10}$-free signed graphs with $\Omega(n^{6/5})$ edges and use octagon examples to illustrate the limitations of theta-freeness as a signing criterion.

math.CO↗
arXiv2026

Fractional DP-colorings of $d$-degenerate locally sparse graphs

Bernshteyn, Kostochka, and Zhu (2020) introduced the notion of fractional DP-coloring, which generalizes both fractional coloring and fractional list coloring. Among several foundational results, they proved that every $d$-degenerate bipartite graph $G$ satisfies $\chi_f^{\mathrm{DP}} \le (1 + o(1))\frac{d}{\log d}$, and that this bound is optimal---a stark contrast to ordinary fractional coloring. In this paper, we extend this upper bound to all $d$-degenerate triangle-free graphs, proving that $\chi_f^{\mathrm{DP}} \le (4 + o(1))\frac{d}{\log d}$. This generalizes a recent result of Martinsson and Steiner (2025) for ordinary fractional coloring. We derive this result as a corollary of a more general upper bound concerning locally sparse graph orderings. Specifically, a $d$-degenerate graph $G$ is left $k$-locally-sparse if it admits a degeneracy ordering in which, for every vertex $v$, the subgraph induced by its back-neighbors contains at most $k$ edges. We show that if a $d$-degenerate graph $G$ is left $\frac{d^2}{f}$-locally-sparse, then \[ \chi_f^{\mathrm{DP}}(G) \le (8 + o(1))\frac{d}{\log f}. \] This immediately yields an identical upper bound on the ordinary fractional chromatic number $\chi_f(G)$, improving upon the leading constants of previously known bounds. Additionally, we establish the asymptotic sharpness of this result up to the leading constant. For any $1 \ll f \le d^2$, we construct $d$-degenerate graphs that are left $\frac{d^2}{f}$-locally-sparse and satisfy $\chi_f(G) \ge (1 - o(1))\frac{d}{\log f}$. Finally, as applications of our main theorem, we obtain improved upper bounds on the fractional DP-chromatic number of $d$-degenerate $K_{1,t,t}$-free graphs, as well as $K_{t,t,t}$-free graphs with maximum degree $\Delta$. Notably, these bounds improve upon existing results even in the setting of ordinary fractional coloring.

math.CO↗
arXiv2026

Erd\H{o}s-S\'{o}s for digraphs

It is shown that every Eulerian digraph on $n$ vertices with more than $(t-1)n$ arcs contains every oriented tree with $t$ edges. The digraphs have no loops or repeated arcs, but opposite arcs are permitted. The bound is sharp for each fixed oriented tree, as witnessed by disjoint unions of complete bidirected graphs. Previously, such tight bounds were not known, even just for directed paths. This can be considered as a directed analog of the recently proved Erd\H{o}s-S\'os conjecture. The result was proved by GPT-6 Astra.

math.CO↗