# The intersection problem for a five vertex dragon

```@article{Mortimer1996TheIP,
title={The intersection problem for a five vertex dragon},
author={Ian Mortimer},
journal={Australasian J. Combinatorics},
year={1996},
volume={14},
pages={109-120}
}```
The intersection problem for block a..sks for values of k it is to find two B d and based on the V, with IBI n B:;d k; that is, k common blocks. We define to be the of cornDI.ete graph solve the intersection 1 1.1 Let G be a (undirected) which is some subgraph of another graph H. A G-decomposdion of H is a block (V, where V is the vertex set of Hand B decomposition of H into copies of G. In the case where H is Knl on n vertices, this is also called a G-design of order n. The intersection… CONTINUE READING

## The intersection problem for graphs with six vertices, six edges and a 4-cycle subgraph

Australasian J. Combinatorics • 2001
View 3 Excerpts
Highly Influenced

## Decomposition of complete graphs into isomorphic subgraphs with five vertices

J.-C. Bermond, C. Huang, A. Rosa, D. Sotteau
Ars Combinatoria • 1980
View 2 Excerpts