On Generalized Turán Results in Height Two Posets

DOI10.1137/21M1457254MaRDI QIDQ5088600

József Balogh, Balázs Patkós, Ryan R. Martin, Dániel T. Nagy

Publication date: 13 July 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.08898

zbMATH Keywords

comparable pairsgeneralized Turánbutterfly-free poset

Mathematics Subject Classification ID

Partial orders, general (06A06) Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Diamond-free families
• Generalized forbidden subposet problems
• Incomparable copies of a poset in the Boolean lattice.
• Packing posets in the Boolean lattice.
• An upper bound on the size of diamond-free families of sets
• On the number of containments in \(P\)-free families
• Set families with a forbidden subposet
• Two applications (for search theory and truth functions) of Sperner type theorems
• Largest family without \(A \cup B \subseteq C \cap D\)
• Progress on poset-free families of subsets
• The distance of \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} \(\mathcal{F}\) \end{document}-free hypergraphs
• Extremal Finite Set Theory
• On maximal paths and circuits of graphs
• l-Chain Profile Vectors
• On a lemma of Littlewood and Offord
• On the structure of linear graphs
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: On Generalized Turán Results in Height Two Posets