Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.06977

Counting Graph Homomorphisms in Bipartite Settings

Igal Sason
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper studies the problem of counting homomorphisms from a bipartite source graph to a bipartite target graph. An exact formula is first derived for the number of homomorphisms from a complete bipartite graph to a general bipartite graph. Although exact, its evaluation is typically computationally intensive, and a computationally tractable combinatorial lower bound is derived. When the target graph contains no 4-cycles, the lower bound simplifies and becomes exact. Two additional lower bounds on the number of homomorphisms from a complete bipartite graph to an arbitrary bipartite graph are derived using properties of Shannon entropy. The first depends only on the sizes of the partite sets in the source and target graphs, together with the edge density of the target graph. The second further incorporates the degree profiles of the partite sets of the target graph, thereby strengthening the first bound. Both entropy-based bounds improve upon the inequality implied by the validity of Sidorenko's conjecture for complete bipartite source graphs. The lower bounds for complete bipartite source graphs are combined with new auxiliary results to derive general lower bounds on homomorphism counts between arbitrary bipartite graphs. Furthermore, a known reverse Sidorenko inequality is employed to derive a corresponding upper bound. This upper bound is attained when the source graph is a disjoint union of complete bipartite graphs, and admits a simple closed-form expression when the target graph contains no 4-cycles. Numerical results compare the new computationally tractable bounds with exact homomorphism counts in cases where exact computation is feasible.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Igal Sason. 2026-07-19. Counting Graph Homomorphisms in Bipartite Settings. https://arxiv.org/abs/2508.06977

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

KEEP EXPLORING

Related papers

arXiv2026

Matching Complexes of Outerplanar Graphs

An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we prove that the matching complexes of outerplanar graphs are contractible or homotopy equivalent to a wedge of spheres. This extends known results about trees and polygonal line tilings.

math.CO↗
arXiv2026

Awesome graph parameters

For a graph $G$, we denote by $α(G)$ the size of a maximum independent set and by $ω(G)$ the size of a maximum clique in $G$. Our paper lies on the edge of two lines of research, related to $α$ and $ω$, respectively. One of them studies $α$-variants of graph parameters, such as $α$-treewidth or $α$-degeneracy. The second line deals with graph classes where some parameters are bounded by a function of $ω(G)$. A famous example of this type is the family of $χ$-bounded classes, where the chromatic number $χ(G)$ is bounded by a function of $ω(G)$. A Ramsey-type argument implies that if the $α$-variant of a graph parameter $ρ$ is bounded by a constant in a hereditary class $\mathcal{G}$, then $ρ$ is bounded by a function of $ω$ in $\mathcal{G}$. If the reverse implication also holds, we say that $ρ$ is awesome. Otherwise, we say that $ρ$ is awful. In the present paper, we identify a number of awesome and awful graph parameters, derive some algorithmic applications of awesomeness, and propose a number of open problems related to these notions.

math.CO↗
arXiv2026

Perfect matchings and $A_α$-spectral radius in 1-binding graphs

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. For $α\in[0,1)$, we use $A_α(G)$ and $ρ_α(G)$ to denote the $A_α$-matrix and the $A_α$-spectral radius of $G$, respectively. The binding number $\mbox{bind}(G)$ of $G$ is defined by $\mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptyset\neq X\subseteq V(G),N_G(X)\neq V(G)\right\}$. If $\mbox{bind}(G)\geq1$, then $G$ is called 1-binding. A perfect matching in $G$ is a set of nonadjacent edges covering every vertex of $G$. Tutte proved that a graph $G$ of even order has a perfect matching if and only if $o(G-S)\leq|S|$ holds for every $S\subseteq V(G)$ [W. Tutte, The factorization of linear graphs, J. Lond. Math. Soc. 22 (1947) 107--111]. In this paper, we use Tutte's result to prove that a connected 1-binding graph $G$ of even order $n$ with $n\geq n(α)$ has a perfect matching unless $G=K_1\vee(K_{n-5}\cup K_3\cup K_1)$ if $ρ_α(G)\geqρ_α(K_1\vee(K_{n-5}\cup K_3\cup K_1))$, where $n(α)$ is defined as follows: $n(α)=\max\{18,\frac{2+8α}{1-2α}\}$ if $α\in[0,\frac{1}{2})$, and $n(α)=18$ if $α=\frac{1}{2}$.

math.CO↗