Upper bounds for the size of ordered L-intersecting set systems
Abstract
A family F=\F1,…,Fm\ of subsets of [n] is said to be ordered, if there exists an 1≤ r≤ m index such that n∈ Fi for each 1≤ i≤ r, n Fi for each i>r and |Fi|≤ |Fj| for each 1≤ i<j≤ m. Our main result is a new upper bound for the size of ordered L-intersecting set systems.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.