Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1407.5174

On the intersection of three or four transversals of the back circulant latin square B_n

Trent Gregory Marbach
View original source ↗Read source document ↗Export metadata ↓

Abstract

A paper by Cavenagh and Wanless diagnosed the possible intersection of any two transversals of the back circulant Latin square B_n, and used the result to completely determine the spectrum for 2-way k-homogeneous latin trades. We give a generalization of this problem for the intersection of μtransversals of B_n and provide a construction for this problem, as well as providing base designs for the construction in the cases μ= 3, 4 found by a computational search. This result is then applied to the problem of finding μ-way k-homogeneous Latin trades. We generalize this problem to the intersection of μtransversals of B_n such that the transversals intersect stably (that is, the intersection of any pair of transversals is independent of the choice of the pair) and show that these structures can be used to construct μ-way k-homogeneous circulant latin trades of odd order. We provide a number of basic existence and non-existence results for μtransversals of B_n that intersect stably, as well as the results of a computational search for small n. This is followed by the principal results of this paper; a construction that covers a large portion of the spectrum when n is sufficiently large, which requires certain base designs. These base designs are provided in the cases μ= 3,4, which were found by a computational search. We use this result to find the existence of μ-way k-homogeneous circulant latin trades of odd order, for μ= 3, 4.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Trent Gregory Marbach. 2015-03-16. On the intersection of three or four transversals of the back circulant latin square B_n. https://arxiv.org/abs/1407.5174

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗