ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Discrete Mathematics
Volume 159, Issues 1-3, 1 November 1996, Pages 261-263
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (167 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0012-365X(95)00117-F    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 1996 Published by Elsevier Science B.V.

Note

Bounding graphical t-wise balanced designs

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Leo G. Chouinard, II

Department of Mathematics and Statistics, University of Nebraska-Lincoln, Lincoln, NE 68588-0323, USA


Received 5 January 1994; 
revised 29 November 1994. 
Available online 20 February 1999.

Abstract

Let X be the edges of the complete graph Kn on n vertices, provided with the natural action of Sn, the automorphism group of Kn. A t-wise balanced design (X, B) with parameters t-((2n), K, λ) is said to be graphical if B is fixed under the action of Sn. We show that for any pair (t, λ) with t> 1 or λ odd, there cannot exist a non-trivial graphical t-((2n), K, λ) design with n greater-or-equal, slanted 2t + λ + 4. Thus, in particular, for each such pair (t, λ) there are only a finite number of non-trivial graphical t-(v, K, λ) designs. If we further assume no repeated blocks, then for all cases with t> 1 or λ ≠ 2, there do not exist non-trivial graphical t-((2n), K, λ) designs with n greater-or-equal, slanted 2t + λ + 4.

Article Outline

• References

Discrete Mathematics
Volume 159, Issues 1-3, 1 November 1996, Pages 261-263
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.