Cycles in the block-intersection graph of pairwise balanced designs

Simple item page
dc.contributor.authorHare, Donovan R
dc.date.accessioned2010-04-20T20:57:34Z
dc.date.available2010-04-20T20:57:34Z
dc.date.copyright1991en
dc.date.issued2010-04-20T20:57:34Z
dc.description.abstractIt is shown that the block-intersection graph of pairwise balance design with (lambda)=1 has cycles of all possible lengths given that its minimum block size is at least 3.en
dc.identifier.urihttp://hdl.handle.net/1828/2624
dc.language.isoenen
dc.relation.ispartofseriesDMS-573-IRen
dc.subjecttechnical reports (mathematics and statistics)
dc.subject.departmentDepartment of Mathematics and Statistics
dc.titleCycles in the block-intersection graph of pairwise balanced designsen
dc.typeTechnical Reporten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
DMS 573.pdf
Size:
485.12 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.84 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Faculty and Staff Publications
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.