Economical covers with geometric applications

Proceedings of the London Mathematical Society

Volumn 86, Issue 2, 2003, Pages 273-301

  Alon, Noga ^a   Bollobás, Béla ^b,c   Kim, Jeong Han ^d   Vu, Van H ^e  

^a TEL AVIV UNIVERSITY   (Israel)

^b University of Memphis   (United States)

^c TRINITY COLLEGE   (United Kingdom)

^d MICROSOFT RESEARCH   (United States)

^e UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037349507     PISSN: 00246115     EISSN: None     Source Type: Journal    
DOI: 10.1112/S0024611502013886     Document Type: Conference Paper

References (28)

1. M. AJTAI, J. KOMLÓS and E. SZEMERÉD, 'A dense infinite Sidon sequence', European J. Combin. 2 (1981) 1-11.
2. N. ALON, 'Transversal numbers of uniform hypergraphs', Graphs Combin. 6 (1990) 1-4.
3. N. ALON, J. H. KIM and J. SPENCER, 'Nearly perfect matchings in regular simple hypergraphs', Israel J. Math. 100 (1997) 171-187.
4. N. ALON and J. H. SPENCER, The probabilistic method, 2nd edn (Wiley, New York, 2000).
5. K. AZUMA, 'Weighted sums of certain dependent random variables', Tokuku Math. J. 19 (1967) 357-367.
6. B. BOLLOBÁS, 'A probabilistic proof of an asymptotic formula for the number of labelled regular graphs', European J. Combin. 1 (1980) 311-316.
7. I. P. F. DA SILVA and K. FUKUDA, 'Isolating lines in the plane', J. Geom. 62 (1998) 48-65.
8. P. ERDOS and H. HANANI, 'On a limit theorem in combinatorial analysis', Publ. Math. Debrecen 10 (1963) 10-13.
9. P. FRANKL and V. RÖDL, 'Near perfect coverings in graphs and hypergraphs', European J. Combin. 6 (1985) 317-326.
10. D. A. GRABLE, 'More-than-nearly perfect packings and partial designs', Combinatorica 19 (1999) 221-239.
11. W. HOEFEDING, 'Probability inequalities for sums of bounded random variables', J. Amer. Statist. Assoc. 27 (1963) 13-30.
12. A. JOHANSSON, 'An improved upper bound on the choice number for triangle free graphs', Combin. Probab. Comput. to appear.
13. J. KAHN, 'Coloring nearly-disjoint hypergraphs with n + o(n) colors', J. Combin. Theory Ser. A 59 (1991) 31-39.
14. J. KAHN, 'On a problem of Erdos and Lovász: random lines in a projective plane', Combinatorica 12 (1992) 417-423.
15. J. KAHN, 'Asymptotically good list-colorings', J. Combin. Theory Ser. A 73 (1996) 1-59.
16. J.-H. KIM, 'On Brooks' theorem for sparse graphs', Combin. Probab. Comput. 4 (1995) 97-132.
17. 2/log t', Random Structures Algorithms 7 (1995) 173-207.
18. J.-H. KIM, 'Nearly optimal partial Steiner systems', Technical Report, Microsoft Research, Redmond, 2000.
19. J.-H, KIM and V. H. Vu, 'Concentration of multivariate polynomials and its applications', Combinatorica 20 (2000) 417-434.
20. J.-H, KIM and V. H. Vu, 'Small complete arcs on finite projective planes', Combinatorica, to appear.
21. A. KOSTOCHKA and V. RÖDL, 'Partial Steiner systems and matchings in hypergraphs', Random Structures Algorithms 13 (1998) 235-240.
22. M. MOLLOY and B. REED, 'A bound on the total chromatic number', Combinatorica 18 (1998) 241-280.
23. N. PIPPENGER and J. H. SPENCER, 'Asymptotic behaviour of the chromatic index for hypergraphs', J. Combin. Theory Ser. A 51 (1989) 24-42.
24. V. RÖDL, 'On a packing and covering problem', European J. Combin. 6 (1985) 69-78.
25. M. TALAGRAND, 'Concentration of measures and isopermetric inequalites in product spaces', Inst. Hautes Études Sci. Publ. Math. 81 (1996) 73-205.
26. V. H. VU, 'On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs', J. Graph Theory 31 (1999) 201-226.
27. V. H. VU, 'On nearly perfect matchings of hypergraphs: higher codegrees do help', Random Structures Algorithms 17 (2000) 29-63.
28. V. H. VU, 'A new upper bound on the list chromatic number of locally sparse graphs', Combin. Probab. Comput. 11 (2002) 103-111.