Name
Abstract | ||
|---|---|---|
For a set L of positive integers, a set system F subset of 2([n]) is said to be L-close Sperner, if for any pair F, G of distinct sets in F the skew distance sd(F, G) = min{vertical bar F\G vertical bar,vertical bar G\F vertical bar} belongs to L. We reprove an extremal result of Boros, Gurvich, and Milanic on the maximum size of L-close Sperner set systems for L = {1}, generalize it to vertical bar L vertical bar = 1, and obtain slightly weaker bounds for arbitrary L. We also consider the problem when L might include 0 and reprove a theorem of Frankl, Furedi, and Pach on the size of largest set systems with all skew distances belonging to L = {0,1}. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s00373-021-02280-2 | GRAPHS AND COMBINATORICS |
Keywords | DocType | Volume |
Extremal set systems, Sperner type theorems, Polynomial method | Journal | 37 |
Issue | ISSN | Citations |
3 | 0911-0119 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dániel T. Nagy | 1 | 0 | 2.37 |
| Balázs Patkós | 2 | 0 | 0.34 |