Search arXivSearch

arXiv · 1912.08610

Symmetrical 2-extensions of the 3-dimensional grid. I

Abstract

For a positive integer $d$, a connected graph $Γ$ is a symmetrical 2-extension of the $d$-dimensional grid $Λ^d$ if there exists a vertex-tran\-sitive group $G$ of automorphisms of $Γ$ and its imprimitivity system $σ$ with blocks of order 2 such that there exists an isomorphism $φ$ of the quotient graph $Γ/σ$ onto $Λ^d$. The tuple $(Γ, G, σ, φ)$ with specified components is called a realization of the symmetrical 2-extension $Γ$ of the grid $Λ^{d}$. Two realizations $(Γ_1, G_1,$ $σ_1, φ_1)$ and $(Γ_2, G_2, σ_2, φ_2)$ are called equivalent if there exists an isomorphism of the graph $Γ_1$ onto $Γ_2$ which maps $σ_1$ onto $σ_2$. V. Trofimov proved that, up to equivalence, there are only finitely many realizations of symmetrical $2$-extensions of $Λ^{d}$ for each positive integer $d$. E. Konovalchik and K. Kostousov found all, up to equivalence, realizations of symmetrical 2-extensions of the grid $Λ^2$. In this work we found all, up to equivalence, realizations $(Γ, G, σ, φ)$ of symmetrical 2-extensions of the grid $Λ^3$ for which only the trivial automorphism of $Γ$ preserves all blocks of $σ$ (we prove that there are 5573 such realizations, and that among corresponding graphs $Γ$ there are 5350 pairwise non-isomorphic).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kirill Kostousov. 2019-12-17. Symmetrical 2-extensions of the 3-dimensional grid. I. https://arxiv.org/abs/1912.08610

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