Disjoint representability of sets and their complements (Q2565684): Difference between revisions

For a hypergraph \(H\) and a set \(S\), the trace of \(H\) on \(S\) is the set of all intersections of edges of \(H\) with \(S\). The paper under review studies forbidden trace problems, i.e., find the largest hypergraph \(H\) that does not contain some list of forbidden configurations as traces. The authors focus on combinations of three forbidden configurations: the \(k\)-singleton \([k]^{ (1) }\), the \(k\)-co-singleton \([k]^{ (k-1) }\), and the \(k\)-chain \(\left\{ \emptyset, \left\{ 1 \right\} , [1,2], \dots, [1,k-1] \right\}\). Here we write \([k]^{ (j) }\) for the set of all \(j\)-subsets of \([k] = \left\{ 1, 2, \dots, k \right\}\).