Upper bounds for the size of ordered $L$-intersecting set systems
Combinatorics
2024-11-08 v1
Abstract
A family \mbox{\cal F}=\{F_1,\ldots,F_m\} of subsets of is said to be ordered, if there exists an index such that for each , for each and for each . Our main result is a new upper bound for the size of ordered -intersecting set systems.
Cite
@article{arxiv.2411.04618,
title = {Upper bounds for the size of ordered $L$-intersecting set systems},
author = {Gábor Hegedüs},
journal= {arXiv preprint arXiv:2411.04618},
year = {2024}
}