Three layer \(Q _{2}\)-free families in the Boolean lattice (Q2376901): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972409259 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1108.4373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(Q _{2}\)-free families in the Boolean lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set families with a forbidden subposet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest families without an \(r\)-fork / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest family without \(A \cup B \subseteq C \cap D\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a lemma of Littlewood and Offord / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong versions of Sperner's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: No four subsets forming an \(N\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Families of Subsets With a Forbidden Subposet / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partition method for poset-free families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diamond-free families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem with excluded subposet in the Boolean lattice / rank
 
Normal rank

Latest revision as of 14:41, 6 July 2024

scientific article
Language Label Description Also known as
English
Three layer \(Q _{2}\)-free families in the Boolean lattice
scientific article

    Statements