Avoiding brooms, forks, and butterflies in the linear lattices

DOI10.1007/s11083-019-09501-7zbMath1481.06018arXiv1807.06259OpenAlexW2883833877MaRDI QIDQ781522

Shahriar Shahriari, Song Yu

Publication date: 17 July 2020

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

broombutterflyextremal combinatoricsforbidden posetlinear latticessubspace latticesbowtieforknormalized matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)

Related Items (2)

The covering lemma and q-analogues of extremal set theory problems ⋮ On forbidden poset problems in the linear lattice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diamond-free families
• Exact forbidden subposet results using chain decompositions of the cycle
• Forbidden subposet problems with size restrictions
• An upper bound on the size of diamond-free families of sets
• Forbidding rank-preserving copies of a poset
• On forbidden poset problems in the linear lattice
• Largest family without \(A \cup B \subseteq C \cap D\)
• Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
• A generalization of Sperner's lemma
• Some Results on Matching in Bipartite Graphs

This page was built for publication: Avoiding brooms, forks, and butterflies in the linear lattices