Pages that link to "Item:Q1703452"
From MaRDI portal
The following pages link to An upper bound on the size of diamond-free families of sets (Q1703452):
Displaying 18 items.
- Diamond-free subsets in the linear lattices (Q466889) (← links)
- An improvement of the general bound on the largest family of subsets avoiding a subposet (Q523149) (← links)
- Families of subsets without a given poset in double chains and Boolean lattices (Q722595) (← links)
- \(Q _{2}\)-free families in the Boolean lattice (Q766139) (← links)
- Avoiding brooms, forks, and butterflies in the linear lattices (Q781522) (← links)
- Forbidden induced subposets of given height (Q1621436) (← links)
- A note on the size of \(\mathscr{N}\)-free families (Q1677188) (← links)
- Forbidden subposet problems with size restrictions (Q1689034) (← links)
- Forbidden subposet problems for traces of set families (Q1784275) (← links)
- Rainbow Ramsey problems for the Boolean lattice (Q2088071) (← links)
- A simple proof for a forbidden subposet problem (Q2290360) (← links)
- Poset-free families and Lubell-boundedness (Q2347975) (← links)
- Abelian groups yield many large families for the diamond problem (Q2354831) (← links)
- Existence thresholds and Ramsey properties of random posets (Q3386529) (← links)
- On Generalized Turán Results in Height Two Posets (Q5088600) (← links)
- Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems (Q5366963) (← links)
- The covering lemma and q-analogues of extremal set theory problems (Q6094181) (← links)
- A construction for Boolean cube Ramsey numbers (Q6171424) (← links)
