Generating all subsets of a finite set with disjoint unions (Q640845): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2149006854
@@ Property / OpenAlex ID: W2149006854 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4877
@@ Property / arXiv ID: 1010.4877 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of disjoint pairs in a family of subsets
+Normal rank
@@ Property / cites work @@
+Testing <i>k</i>-colorability
@@ Property / cites work: Testing <i>k</i>-colorability / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal Graphs without Large Forbidden Subgraphs
@@ Property / cites work: Extremal Graphs without Large Forbidden Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some intersection theorems for ordered sets and graphs
+Normal rank
@@ Property / cites work @@
+Note on generating all subsets of a finite set with disjoint unions
+Normal rank
@@ Property / cites work @@
+Q5724802
@@ Property / cites work: Q5724802 / rank @@
+Normal rank
@@ Property / cites work @@
+Supersaturated graphs and hypergraphs
@@ Property / cites work: Supersaturated graphs and hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Generating All Sets With Bounded Unions
@@ Property / cites work: Generating All Sets With Bounded Unions / rank @@
+Normal rank
@@ Property / cites work @@
+-Bases of Quadruples
@@ Property / cites work: 2-Bases of Quadruples / rank @@
+Normal rank