location:  Publications → journals
Search results

Search: All articles in the CMB digital archive with keyword graph decomposition

 Expand all        Collapse all Results 1 - 2 of 2

1. CMB 2015 (vol 58 pp. 610)

Rodger, C. A.; Whitt, Thomas Richard
 Path Decompositions of Kneser and Generalized Kneser Graphs Necessary and sufficient conditions are given for the existence of a graph decomposition of the Kneser Graph $KG_{n,2}$ and of the Generalized Kneser Graph $GKG_{n,3,1}$ into paths of length three. Keywords:Kneser graph, generalized Kneser graph, path decomposition, graph decompositionCategories:05C51, 05C70

2. CMB 2007 (vol 50 pp. 504)

Dukes, Peter; Ling, Alan C. H.
 Asymptotic Existence of Resolvable Graph Designs Let $v \ge k \ge 1$ and $\lam \ge 0$ be integers. A \emph{block design} $\BD(v,k,\lambda)$ is a collection $\cA$ of $k$-subsets of a $v$-set $X$ in which every unordered pair of elements from $X$ is contained in exactly $\lambda$ elements of $\cA$. More generally, for a fixed simple graph $G$, a \emph{graph design} $\GD(v,G,\lambda)$ is a collection $\cA$ of graphs isomorphic to $G$ with vertices in $X$ such that every unordered pair of elements from $X$ is an edge of exactly $\lambda$ elements of $\cA$. A famous result of Wilson says that for a fixed $G$ and $\lambda$, there exists a $\GD(v,G,\lambda)$ for all sufficiently large $v$ satisfying certain necessary conditions. A block (graph) design as above is \emph{resolvable} if $\cA$ can be partitioned into partitions of (graphs whose vertex sets partition) $X$. Lu has shown asymptotic existence in $v$ of resolvable $\BD(v,k,\lambda)$, yet for over twenty years the analogous problem for resolvable $\GD(v,G,\lambda)$ has remained open. In this paper, we settle asymptotic existence of resolvable graph designs. Keywords:graph decomposition, resolvable designsCategories:05B05, 05C70, 05B10
 top of page | contact us | privacy | site map |