On the lottery problem

Journal of Combinatorial Designs

Volumn 4, Issue 1, 1996, Pages 5-10

  Füredi, Zoltán ^a,b   Székely, Gábor J ^c,d   Zubor, Zoltán ^c  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^c BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^d BOWLING GREEN STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2942560918     PISSN: 10638539     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6610(1996)4:1<5::AID-JCD2>3.0.CO;2-J     Document Type: Article

References (20)

1. Th. Beth, D. Jungnickel, and H. Lenz, Design theory, Bibliographisches Institute, Zürich, 1985.
2. B. Bollobás, Extremal graph theory, Academic Press, London-New York, 1978.
3. A. E. Brouwer, Some lotto numbers from an extension of Turán's theorem, Math. Centre report 1978. MR82c: 05057
4. A. E. Brouwer and M. Voorhoeven, Turán theory and the Lotto problem, Math. Centre Tracts 106 (1979), 99-105. (Packing and covering in combinatorics, A. Schrijver, (Editor), MR81b:05001).
5. A. E. Brouwer and M. Voorhoeven, Turán theory and the Lotto problem, Math. Centre Tracts 106 (1979), 99-105. (Packing and covering in combinatorics, A. Schrijver, (Editor), MR81b:05001).
6. D. De Caen, Extension of a theorem of Moon and Moser on complete subgraphs, Ars Combin. 16 (1983), 5-10.
7. P. Dembowski, Finite geometries, Springer, Berlin, 1968.
8. P. Erdos, On the graph theorem of Turán, Mat. Lapok 21 (1970), 249-251 (in Hungarian). MR46 # 7090.
9. M. K. Fort, Jr. and G. A. Hedlund, Minimal coverings of pairs by triples, Pacific J. Math. 8 (1958), 709-719.
10. M. Hall, Jr., Combinatorial theory, Wiley, New York, 1967.
11. H. Hanani, D. Ornstein, and V. T. Sós, On the lottery problem, Magyar Tud. Akad. Mat. Kutató Int. Közl. 9 (1964) 155-158. MR29 # 5479
12. W. H. Mills, On the covering of pairs by quadruples, I, II, J. Combin. Theory Ser. A 13 (1972), 55-78, 15 (1973), 138-166.
13. W. H. Mills, On the covering of pairs by quadruples, I, II, J. Combin. Theory Ser. A 13 (1972), 55-78, 15 (1973), 138-166.
14. J. Schönheim, On coverings, Pacific J. Math. 14 (1964), 1405-1411.
15. F. Sterboul, Le problème du Loto, Proc. Colloq. Intern. Mathematiques Discrètes: Codes et Hypergraphes, Brussels, 1978.
16. P. Turán, On an extremal problem in graph theory, Mat. Fiz. Lapok 48 (1941), 436-452 (in Hungarian). Also see: On the theory of graphs, Colloq. Math. 3 (1954), 19-30.
17. P. Turán, On an extremal problem in graph theory, Mat. Fiz. Lapok 48 (1941), 436-452 (in Hungarian). Also see: On the theory of graphs, Colloq. Math. 3 (1954), 19-30.
18. _, Research problems, Magyar Tud. Akad. Mat. Kutató Int. Közl. 6 (1961), 417-423.
19. R. M. Wilson, On existence theory for pairwise balanced designs, I, II, III, J. Combin. Theory Ser. A 13 (1972), 220-245, 246-273; 18 (1975), 71-79.
20. R. M. Wilson, On existence theory for pairwise balanced designs, I, II, III, J. Combin. Theory Ser. A 13 (1972), 220-245, 246-273; 18 (1975), 71-79.