Sunflowers and -intersecting families
Let stand for the least number so that if is an arbitrary -uniform, -intersecting set system, where , and has more than elements, then contains a sunflower with petals. We give an upper bound for .
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.02.005 |
| id |
doaj-58ed96b3ebcd4927a8afec6d78b09811 |
|---|---|
| record_format |
Article |
| spelling |
doaj-58ed96b3ebcd4927a8afec6d78b098112020-12-17T17:28:37ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002543-34742020-01-0117140240610.1016/j.akcej.2019.02.0051760571Sunflowers and -intersecting familiesGábor Hegedűs0Óbuda UniversityLet stand for the least number so that if is an arbitrary -uniform, -intersecting set system, where , and has more than elements, then contains a sunflower with petals. We give an upper bound for .http://dx.doi.org/10.1016/j.akcej.2019.02.005-system-intersecting familiesextremal set theory |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Gábor Hegedűs |
| spellingShingle |
Gábor Hegedűs Sunflowers and -intersecting families AKCE International Journal of Graphs and Combinatorics -system -intersecting families extremal set theory |
| author_facet |
Gábor Hegedűs |
| author_sort |
Gábor Hegedűs |
| title |
Sunflowers and -intersecting families |
| title_short |
Sunflowers and -intersecting families |
| title_full |
Sunflowers and -intersecting families |
| title_fullStr |
Sunflowers and -intersecting families |
| title_full_unstemmed |
Sunflowers and -intersecting families |
| title_sort |
sunflowers and -intersecting families |
| publisher |
Taylor & Francis Group |
| series |
AKCE International Journal of Graphs and Combinatorics |
| issn |
0972-8600 2543-3474 |
| publishDate |
2020-01-01 |
| description |
Let stand for the least number so that if is an arbitrary -uniform, -intersecting set system, where , and has more than elements, then contains a sunflower with petals. We give an upper bound for . |
| topic |
-system -intersecting families extremal set theory |
| url |
http://dx.doi.org/10.1016/j.akcej.2019.02.005 |
| work_keys_str_mv |
AT gaborhegedus sunflowersandintersectingfamilies |
| _version_ |
1724379111261995008 |