2015/06/23 by Arès Méroueh, Méroueh, Arès · 1 citation
Computer Science · Mathematics · #05D05 #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #G.2.1 #Limits and Structures in Graph Theory #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1506.07056
openalex publication_date 2015/06/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We prove that for every partially ordered set P, there exists c(P) such that every family F of subsets of [n] ordered by inclusion and which contains no induced copy of P satisfies ∑F∈ F1/n\choose |F|≤ c(P). This confirms a conjecture of Lu and Milans.