Logo image
An improved finiteness theorem for graphical t-designs
Journal article   Peer reviewed

An improved finiteness theorem for graphical t-designs

Yeow Meng Chee
Discrete mathematics, Vol.237(1), pp.185-186
28/06/2001

Abstract

We prove that there exist only finitely many nontrivial graphical t-( v, k, λ) designs when k≤4 t/3. This improves a previous result of Betten et al. (Discrete Math. 197/198 (1999) 83–109).

Metrics

1 Record Views

Details

Logo image