Saturating Sets

Saturating Sets is a construct in incidence geometry that refers to a minimal set of points in a projective space such that every point not in the set is collinear with at least one pair of points from the set.

11

Publications

391

Citations

22

Authors

18

Institutions

Publications per year

2017–2026

1

Authors

22

  1. FP
    Fernanda Pambianco

    University of Perugia, Italy

    4 publications · 76 citations

    4

    h-index

  2. AA
    Alexander A. Davydov

    Institute for Information Transmission Problems, Russia

    4 publications · 84 citations

    4

    h-index

  3. SM
    Stefano Marcugini

    University of Perugia, Italy

    4 publications · 76 citations

    4

    h-index

  4. GF
    Giorgio Faina

    University of Perugia, Italy

    2 publications · 29 citations

    2

    h-index

  5. AD
    Alan D. Taylor

    Union College, United States

    1 publications · 19 citations

    1

    h-index

1–5 of 22

Venues

  1. Journal of Combinatorial Theory Series A

    3 publications · 75 citations

    3

    h-index

  2. Mathematics of Computation

    MCOM · 1 publications · 28 citations

    1

    h-index

  3. Advances in Mathematics

    1 publications · 48 citations

    1

    h-index

  4. Journal of Mathematical Physics

    1 publications · 13 citations

    1

    h-index

  5. European Journal of Combinatorics

    1 publications · 25 citations

    1

    h-index

1–5