Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2505.12776

Independent Set Enumeration in King Graphs by Tensor Network Contractions

Kai Liang
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper discusses the enumeration of independent sets in king graphs of size $m \times n$, based on the tensor network contractions algorithm given in reference~\cite{tilEnum}. We transform the problem into Wang tiling enumeration within an $(m+1) \times (n+1)$ rectangle and compute the results for all cases where $m + n \leq 79$ using tensor network contraction algorithm, and provided an approximation for larger $m, n$. Using the same algorithm, we also enumerated independent sets with vertex number restrictions. Based on the results, we analyzed the vertex number that maximize the enumeration for each pair $(m, n)$. Additionally, we compute the corresponding weighted enumeration, where each independent set is weighted by the number of its vertices (i.e., the total sum of vertices over all independent sets). The approximations for larger $m, n$ are given as well. Our results have added thousands of new items to the OEIS sequences A089980 and A193580. In addition, the combinatorial problems above are closely related to the hard-core model in physics. We estimate some important constants based on the existing results, and the relative error between our estimation of the entropy constant and the existing results is less than $10^{-9}$.

Explore related subjects

math.COcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kai Liang. 2025-06-23. Independent Set Enumeration in King Graphs by Tensor Network Contractions. https://arxiv.org/abs/2505.12776

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

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗