On the non-existence of pair covering designs with at least as many points as blocks-Reference-Cited by-同舟云学术

On the non-existence of pair covering designs with at least as many points as blocks

Published:2011-11 Issue:5 Volume:31 Page:507-528
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Bryant Darryn,Buchanan Melinda,Horsley Daniel,Maenhaut Barbara,Scharaschkin Victor

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/s00493-011-2639-y.pdf

Reference15 articles.

1. P. Adams, D. Bryant and M. Buchanan: A survey on the existence of G-designs, J. Combin. Des. 16 (2008), 373–410.

2. R.C. Bose and W.S. Connor: Combinatorial properties of group divisible incomplete block designs, Ann. Math. Stat. 23 (1952), 367–383.

3. J. C. Bermond and J. Schönheim: G-decomposition of K n, where G has four vertices or less, Discrete Math 19 (1977), 113–120.

4. R. H. Bruck and H. J. Ryser: The nonexistence of certain finite projective planes, Canadian Journal of Mathematics 1 (1949), 88–93.

5. D. Bryant and S. El-Zanati: Graph decompositions, in: The CRC Handbook of Combinatorial Designs, 2nd edition (Eds. C. J. Colbourn, J. H. Dinitz), CRC Press, Boca Raton (2007), 373–382.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New lower bounds for t ‐coverings;Journal of Combinatorial Designs;2017-10-25

2. Generalising Fisher’s inequality to coverings and packings;Combinatorica;2016-10-17

3. More nonexistence results for symmetric pair coverings;Linear Algebra and its Applications;2015-12