running_intersection_property (462B)
1 # Running intersection property 2 3 The *running intersection property* on a set of [hyperedges] means that we can write them in an order e_1, ..., e_m such that, for any k > 1, there is j < k with p_k cap (cup_{i<k} p_i) included in p_j 4 5 In other words, the elements of p_k that were already seen before are all witnessed in a single predecessor 6 7 Defined in [beeri1983desirability], equivalent to being [alpha_acyclic] 8 9 See also: [alpha_acyclic] 10 11 Up: [hypergraph]