Small saturated sets in finite projective planes S

    @inproceedings{KovacsSmallSS,
      title={Small saturated sets in finite projective planes S},
      author={Sandor Kovacs}
    }
    We recall some well known notions (see [3]). A k-arc is a set of k points no three of which are collinear. A k-arc is said to be complete if it is not contained in a k + l-arc. As it is well known the maximum value of k such that a projective plane of order q may contain k-arcs is k = q + 1 or k = q + 2 according as q is odd or even. A k-arc with this maximum number of points is called an oval. A k-sei will mean a set of k points. 

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 12 CITATIONS

    New upper bounds on the smallest size of a saturating set in a projective plane

    • 2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)
    • 2015
    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Random constructions and density results

    • Des. Codes Cryptogr.
    • 2008
    VIEW 1 EXCERPT
    CITES BACKGROUND

    On Small Dense Sets in Galois Planes

    • Electr. J. Comb.
    • 2007
    VIEW 1 EXCERPT
    CITES METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-5 OF 5 REFERENCES

    Arcs in cubic curves and 3-independent subsets of abelian groups

    T. SZONYI
    • Colloq. Math. Soc. J. Bolyai
    • 1987

    k-insiemi densi in piani di Galois

    U. BARTOCCI
    • Boll. U.M.1. VI
    • 1983
    VIEW 1 EXCERPT