On families of sets without \(k\) pairwise disjoint members (Q1745733): Difference between revisions

@@ Property / DOI @@
-.1016/j.jctb.2017.10.002
@@ Property / DOI: 10.1016/j.jctb.2017.10.002 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jctb.2017.10.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2765125610
@@ Property / OpenAlex ID: W2765125610 / rank @@
+Normal rank
@@ Property / cites work @@
+INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
@@ Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank @@
+Normal rank
@@ Property / cites work @@
+Families with no s pairwise disjoint sets
@@ Property / cites work: Families with no s pairwise disjoint sets / rank @@
+Normal rank
@@ Property / cites work @@
+Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
+Normal rank
@@ Property / cites work @@
+Families with no matchings of size \(s\)
@@ Property / cites work: Families with no matchings of size \(s\) / rank @@
+Normal rank
@@ Property / cites work @@
+Q3770569
@@ Property / cites work: Q3770569 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal number of subsets of a finite set No k of which are pairwise disjoint
+Normal rank
@@ Property / DOI @@
+.1016/J.JCTB.2017.10.002
@@ Property / DOI: 10.1016/J.JCTB.2017.10.002 / rank @@
+Normal rank