The following pages link to Partition‐free families of sets (Q5237375):
Displaying 23 items.
- Note on generating all subsets of a finite set with disjoint unions (Q1028810) (← links)
- On families of sets without \(k\) pairwise disjoint members (Q1745733) (← links)
- New inequalities for families without \(k\) pairwise disjoint members (Q1747778) (← links)
- Partition-free families of sets (Q1752685) (← links)
- Absolute equal distribution of families of finite sets. (Q1873701) (← links)
- On \(abab\)-free and \(abba\)-free set partitions (Q1908273) (← links)
- The partition method for poset-free families (Q1956245) (← links)
- Lower bounds on the clique-chromatic numbers of some distance graphs (Q2043671) (← links)
- On a Frankl-Wilson theorem (Q2190926) (← links)
- New bounds on clique-chromatic numbers of Johnson graphs (Q2192124) (← links)
- Non-trivial \(d\)-wise intersecting families (Q2221841) (← links)
- On stability of the independence number of a certain distance graph (Q2229578) (← links)
- Modularity of some distance graphs (Q2243703) (← links)
- New bounds for the clique-chromatic numbers of Johnson graphs (Q2243705) (← links)
- On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2304365) (← links)
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621) (← links)
- Set Partitions with No m-Nesting (Q2846964) (← links)
- Partitions with certain intersection properties (Q3100729) (← links)
- (Q3147272) (← links)
- Families in which disjoint sets have large union (Q3972125) (← links)
- Families with no s pairwise disjoint sets (Q5357256) (← links)
- Extremal Uniquely Resolvable Multisets (Q5883286) (← links)
- Some results around the Erdős matching conjecture (Q6621203) (← links)
