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
Parents
11
Detecting Location Shifts during Model Selection by Step-Indicator Saturation
Jennifer L. Castle, Jurgen A. Doornik, David F. Hendry et al. · Econometrics · 2015 · 154 citations · Full text
Induced and non-induced poset saturation problems
Balázs Keszegh, Nathan Lemons, Ryan R. Martin et al. · Journal of Combinatorial Theory Series A · 2021 · 28 citations · Full text
1–5 of 11
22
4
h-index
Institute for Information Transmission Problems, Russia
4 publications · 84 citations
4
h-index
4
h-index
2
h-index
1
h-index
1–5 of 22
18
University of Perugia
Perugia, Italy
4 h-index
11 publications
198 citations
Institute for Information Transmission Problems
Moscow, Russia
4 h-index
4 publications
84 citations
Russian Academy of Sciences
Moscow, Russia
2 h-index
2 publications
28 citations

Eötvös Loránd University
Budapest, Hungary
1 h-index
2 publications
56 citations

Alfréd Rényi Institute of Mathematics
Budapest, Hungary
1 h-index
2 publications
56 citations
Los Alamos National Laboratory
Los Alamos, United States
1 h-index
1 publications
28 citations
University of Antwerp
Antwerp, Belgium
1 h-index
2 publications
26 citations

Moscow Institute of Physics and Technology
Dolgoprudnyy, Russia
1 h-index
1 publications
28 citations
1–8 of 18
3 publications · 75 citations
3
h-index
MCOM · 1 publications · 28 citations
1
h-index
1 publications · 48 citations
1
h-index
1 publications · 13 citations
1
h-index
1 publications · 25 citations
1
h-index
1–5