Search arXivSearch

arXiv · 2509.04568

Existence and bounds of growth constants for restricted walks, surfaces, and generalisations

Abstract

We introduce classes of restricted walks, surfaces and their generalisations. For example, self-osculating walks (SOWs) are supersets of self-avoiding walks (SAWs) where edges are still not allowed to cross but may 'kiss' at a vertex. They are analogous to osculating polygons introduced in (Jensen and Guttmann, 1998) except that they are not required to be closed. The 'automata' method of (Pönitz and Tittmann, 2000) can be adapted to such restricted walks. For example, we prove upper bounds for the connective constant for SOWs on the square and triangular lattices to be $μ^{\mathrm{SOW}}_\square \leq 2.73911$ and $μ^{\mathrm{SOW}}_\triangle \leq 4.44931$, respectively. In analogy, we also introduce self-osculating surfaces (SOSs), a superset of self-avoiding surfaces (SASs) which can be generated from fixed polyominoids (XDs). We further generalise and define self-avoiding $k$-manifolds (SAMs) and its supersets, self-osculating $k$-manifolds (SOMs) in the $d$-dim hypercubic lattice and $(d, k)$-XDs. By adapting the concatenation procedure procedure (van Rensburg and Whittington, 1989), we prove that their growth constants exist, and prove an explicit form for their upper and lower bounds. The upper bounds can be improved by adapting the 'twig' method, originally developed for polyominoes (Eden, 1961, Klarner and Rivest, 1973). For the cubic lattice, we find improved upper bounds for the growth constant of SASs as $μ^{\mathrm{SAS}}_{\mathbb{Z}^3} \leq 17.11728$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sun Woo P. Kim, Gabriele Pinna. 2025-09-04. Existence and bounds of growth constants for restricted walks, surfaces, and generalisations. https://arxiv.org/abs/2509.04568

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

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO