Small complete arcs in protective planes

Combinatorica

Volumn 23, Issue 2, 2003, Pages 311-363

  Kim, J H ^a   Vu, V H ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0141655032     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-003-0024-1     Document Type: Article

References (67)

1. h and h≥6 even, Ars Combin. 16 (1983), 103-111.
2. M. AJTAI and J. KOMLÓS and E. SZEMERÉDI: A dense infinite Sidon sequence, Europ. J. Combi. 2 (1981), 1-11.
3. N. ALON and J. SPENCER: The Probabilistic Methods, Wiley, New York, 1992.
4. N. ALON, B. BOLLOBÁS, J.H. KIM and V. H. Vu: Economical covers and geometric applications, Proc. London Math. Soc. (3), 86 (2003), 273-301.
5. N. ALON, J. H. KIM and J. SPENCER: Nearly perfect matchings in regular simple hypergraphs, IJM 100 (1997), 171-187.
6. S. BALL: On small complete arcs in a finite plane, Discrete Math 174 (1997), 29-34.
7. U. BARTOCCI: k-insiemi densi nei piani di Galois, Boll. Un. Mat. Ital. D (6) 2 (1983), 71-77.
8. A.A. BRUEN and J.C. FISHER: Blocking sets and complete arcs, Pacific J. Math. 53 (1974), 73-84.
9. A. BLOKHUIS, Polynomials in finite geometry and combinatorics: Survey in Combinatorics, Cambridge Univ. Press, Cambridge (1993), 35-52.
10. A. BLOKHUIS: Extremal problems in finite geometries, Extremal problems for finite seta, Bolyai Soc. Mathematical studies 3, (1994) 111-135.
11. A. BLOKHUIS: Blocking sets in desarguesian planes, Erdös is eighty, Bolyai society mathematical studies, 2, eds D. Miklós, V.T. Sós, T. Szönyi (1996) 133-155.
12. A.E. BROUWER: On the size of a maximum transversal in a Steiner Triple System, Canadian J. of Math. 33 (1981), 1202-1204.
13. A.A. BRUEN and M.J. DE RESMINI: Blocking sets, k-arcs and nets of order ten, Combinatorics 81, North-Holland Math. Stud. 78, North-Holland, Amsterdam-New York (1983) 169-175.
14. A.A. BRUEN and M.J. DE RESMINI: Blocking sets in affine planes, Annals of Discrete Math. 18 (1983) 169-176.
15. A.A. BRUEN and R. SILVERMAN: Arcs and Blocking sets II, Euro. J. Combi. 8 (1987), 351-356.
16. P. DEMBOWSKI: Finite geometries, Springer 1968.
17. C. DI COMITE: Su k-archi deducibili da cubiche plane, Atti dell' Accad. Naz Lincei Rend. (8) 33 (1962), 429-435.
18. N. G. DE BRUJIN and P. ERDÖS: On a combinatorial problem, Indag. Math 10 (1948) 421-423.
19. C. Di COMITE: Su k-archi deducibili da cubiche piane, Atti dell' Accad. Naz Lincei Rend. (8) 35 (1963), 274-278.
20. q,2, Atti dell'Accad. Naz. Lincei Rend. (8) 47 (1967) 240-244.
21. J.C. FISHER: Random k-arcs, Preliminary report, 1989.
22. J.C. FISHER, J.W.P. HIRSCHFELD and J.A. THAS: Complete arcs in planes of square order. Annal of Discrete Math 30 (1986) 243-250.
23. P. FRANKL and V. RÖDL: Near perfect coverings in graphs and hypergraphs, Europ. J. Combinatorics 6 (1985), 317-326.
24. D. A. GRABLE: More-than-nearly perfect packings and partial designs, Combinatorica 19 (1999), 221-239.
25. R. GRAHAM, M. GRÖTCHEL and L. LOVÁSZ eds, Handbook of Combinatorics, Chapter 13, North Holland, 1995.
26. H. R. HALDER: Zur Existenz von k-Kurven in endlichen Ebenen, J. Geom. 14 (1980), 71-74.
27. J.W.P. HIRSCHFELD; Projective geometries over finite fields, Claredon Press, Oxford (1971).
28. J.W.P. HIRSCHFELD: Algebraic curves and arcs over finite fields, Quad. del Dip. di Mat. Lecce, Q-6 (1987).
29. J.W.P. HIRSCHFELD: Maximum sets in finite projective spaces, Survey in combinatorics, LMS Lecture Note Series 82 Cambridge Univ. Press (1983) 55-76.
30. A. JOHANSSON: An improved upper bound on the choice number for triangle free graphs, submitted.
31. A. JOHANSSON: The choice number of sparse graphs, preprint.
32. L. KADISON and M. T. KRONMANN: "Projective Geometry and Modern Algebra," Birkhäuser, Boston, 1996.
33. J. KAHN: Asymptotically good list colorings, J. of Combi. Th. A. 73 (1996), 1-59.
34. J. H. KIM: On Brooks' theorem for sparse graphs, Combinatorics, Probability and Computing 4 (1995), 97-132.
35. 2/log t, Random structures and algorithms 7 (1995), 173-207.
36. J.H. KIM: Steiner partial systems, submitted.
37. J. H. KIM and V. H. Vu: Concentration of multivariate polynomials and its applications, Combinatorica 20(3) (2000), 417-434.
38. J. H. KIM and V. H. Vu: Divide and conquer martingales and the number of triangles in a random graphs, submitted.
39. G. KORCHMÁROS: New example of complete k-arcs in PG(2,q), Europ. J. Comb. 4 (1983), 329-334.
40. S. J. KOVÁCS: Small saturated sets in finite protective planes, Rend. Mat. Appl. (7) 12 (1992), 157-164.
41. q archi, Ist. Lombardo Accad. Sci. Rend. A 98 (1964), 3-52.
42. 2,q, Boll. Un. Mat. ltal. 11 (1956), 178-181.
43. M. MOLLOY and B. REED: A bound on the total chromatic number, Combinatorica 18 (1998), 241-280.
44. N. PIPPENGER and J. SPENCER: "Asymptotic behavior of the chromatic index for hypergraphs", J. of Combi. Th. A. 51 (1989), 24-42.
45. B. REED and B. SUDAKOV: Asymptotically the list constants are 1, submitted.
46. V. RÖDL: On a packing and covering problem, Europ. J. Combi. 5 (1985), 69-78.
47. R. SCHOOF: Non-singular plane cubic curves over finite fields, J. Combin. Theory Ser. A 46 (1987), 183-211.
48. B. SEGRE: Le geometrie di Galois, Ann. Mat. Pura Appl. 48 (1959), 1-97.
49. B. SEGRE: Introduction to Galois geometry, ed. J.W.P. Hirschfeld, Mem. Accad. Naz. Lincei, (8) (1967), 133-263.
50. B. SEGRE: Ovali e curve σ nei piani de caratteristica due, Atti dell'Accad. Naz. Lincei Rend. (8) 32 (1962), 785-790.
51. T. SZÖNYI: Small complete arcs in Galois planes, Geom. Dedicata 18 (1985), 161-172.
52. T. SZÖNYI: Arcs, caps, codes and 3-independent subsets, Giornate di Geometrie Combinatorie, (edits G. Faina, G. Tallini) Uni. Perugia (1993), 57-80.
53. T. SZÖNYI: Some applications of algebraic curves in finite geometry and combinatorics, Surveys in Combinatorics 1997, 197-236, LMS Lecture Notes 241, Cambridge Univ. Press, 1997.
54. T. SZÖNYI: Complete arcs in PG(2,q), a survey in Quad. del Sem. Geom. Comb. Univ. di Roma ("La Sapienza"), 94 (1989).
55. T. SZÖNYI: Arcs in cubic curves and 3-independent subsets of abelian groups, in Combinatorics, Eger Colloquia Mathematica Societatis János Bolyai, 52, North-Holland, Amsterdam (1987), 499-508.
56. T. SZÖNYI: Small complete arcs in André planes of square order, Graphs and Comb. 8 (1992), 81-89.
57. E. UGHI: Saturated configurations of points in projective Galois spaces, Eur. J. Comb. 8 (1987), 325-334.
58. J.F. VOLOCH: On the completeness of certain plane arcs II, Europ. J. Comb. 11 (1990) 491-496.
59. J.F. VOLOCH: Complete arcs in Galois planes of non-square order, Advance in Finite Geometries and Designs (eds J.W.P. Hirschfeld, D.R. Huges, J.A. Thas) Oxford Univ. Press, Oxford (1991) 401-406.
60. V. H. Vu: Concentration of non-Lipschitz functions and applications, Random Structures and Algorithms 20 (2002), 262-316.
61. V. H. Vu: New bounds on nearly perfect matchings in hypergraphs: higher codegrees do help, Random Structures and Algorithms 17 (2000), 29-63.
62. V. H. Vu: On a refinement of Waring's problem, Duke Math. Journal 105 (2000), 107-134.
63. V. H. Vu: On the concentration of multivariate polynomials with small expectation, Random Structures and Algorithms 16 (2000), 344-363.
64. V. H. Vu: On some degree conditions which guarantee the upper bound of chromatic (choice) number of random graphs, Journal of Graph Theory 31 (1999), 201-226.
65. V. H. Vu: A general upper bound on the list chromatic number of locally sparse graphs, Combinatorics, Probability and Computing 11 (2002), 103-111.
66. V. H. Vu: A large deviation result on the number of small subgraphs of a random graph, Combinatorics, Probability and Computing 10 (2001), 79-94.
67. F. ZIRILLI: Su una classe di k-archi di un piano di Galois, Rend. Accad. Naz. Lincei 54 (1973) 393-397.