Forbidden subposet problems for traces of set families

MaRDI QIDQ1784275

Balázs Patkós, Máté Vizer, Dániel Gerbner

Publication date: 26 September 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

butterfly posetforbidden subposet problemtrace of a set family

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)

Related Items (2)

Edge-ordered Ramsey numbers ⋮ Turán problems for edge-ordered graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(l\)-trace \(k\)-Sperner families of sets
• On the density of sets of vectors
• An upper bound on the size of diamond-free families of sets
• On the trace of finite sets
• A note on traces of set families
• Families that remain \(k\)-Sperner even after omitting an element of their ground set
• A survey of forbidden configuration results
• Set families with a forbidden subposet
• Largest families without an \(r\)-fork
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• On Families of Subsets With a Forbidden Subposet
• Lower bounds for constant weight codes
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On a problem of K. Zarankiewicz
• On a lemma of Littlewood and Offord

This page was built for publication: Forbidden subposet problems for traces of set families