Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.25055

On the Determinant of Kőnig-Egerváry Graphs

Kevin Pereyra
View original source ↗Read source document ↗Export metadata ↓

Abstract

Several graph decompositions that factorize the determinant of the adjacency matrix isolate a Kőnig-Egerváry part, such as the SD--KE decomposition and the critical independence decomposition of Larson. This suggests that the study of graph unimodularity can be approached, to a large extent, through the structure of Kőnig-Egerváry graphs. In this paper we advance this point of view by introducing a new determinant factorization inside the class of Kőnig-Egerváry graphs. More precisely, given a Kőnig-Egerváry graph $G$, we consider the partition of $V(G)$ into its perfect-flower part $PF(G)$ and its perfect-flower-free part $PFF(G)$, and prove that \[ \det(G)=\det(G[PF(G)])\det(G[PFF(G)]). \] We also obtain the analogous factorization for the permanent. This decomposition provides a new tool for the study of unimodularity, reducing the problem to two induced subgraphs of a very different nature: the graph $G[PF(G)]$, whose structure is closely related to Sterboul--Deming configurations with perfect matching, and the graph $G[PFF(G)]$, which is governed by the theory of critical independent sets. In this way, the paper gives a new structural framework for the study of unimodular graphs through Kőnig-Egerváry theory.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kevin Pereyra. 2026-04-27. On the Determinant of Kőnig-Egerváry Graphs. https://arxiv.org/abs/2604.25055

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↗