On crown-free families of subsets

DOI10.1016/j.jcta.2014.04.009zbMath1295.05251arXiv1206.6258MaRDI QIDQ2452431

Linyuan Lu

Publication date: 3 June 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

poset; Boolean lattice; Lubell function; \( k\)-partite representation; crown-free families

Mathematics Subject Classification ID

06A07: Combinatorics of partially ordered sets

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05D05: Extremal set theory

Related Items

Turán problems on non-uniform hypergraphs, On a covering problem in the hypercube, Boolean algebras and Lubell functions, An improvement of the general bound on the largest family of subsets avoiding a subposet, Families of subsets without a given poset in double chains and Boolean lattices, Exact forbidden subposet results using chain decompositions of the cycle, An upper bound on the size of diamond-free families of sets, Abelian groups yield many large families for the diamond problem, Existence thresholds and Ramsey properties of random posets

Cites Work

• Unnamed Item
• Unnamed Item
• Diamond-free families
• \(Q _{2}\)-free families in the Boolean lattice
• An extremal theorem in the hypercube
• Strong versions of Sperner's theorem
• An extremal problem with excluded subposet in the Boolean lattice
• On diamond-free subposets of the Boolean lattice
• Poset-free families and Lubell-boundedness
• Set families with a forbidden subposet
• On extremal problems of graphs and generalized graphs
• Largest families without an \(r\)-fork
• Largest family without \(A \cup B \subseteq C \cap D\)
• A Ramsey-type result for the hypercube
• On 14-Cycle-Free Subgraphs of the Hypercube
• On Families of Subsets With a Forbidden Subposet
• Subgraphs of a hypercube containing no small even cycles
• Turán’s Theorem in the Hypercube
• On a lemma of Littlewood and Offord
• On even-cycle-free subgraphs of the hypercube