I believe the general algorithm to determine the minimum is as follows (in Python)
def get_min_intersection (slices,total = 100):
if sum(slices)- (len(slices)-1) * total >= 0:
return sum(slices)- (len(slices)-1) * total
else:
return 0
# The minimum intersection of [70,80,75,85] out of 100 is 10
assert get_min_intersection([70,80,75,85]) == 10
# The minimum intersection of [90,60,80] out of 100 is 10 according to https://youtu.be/GcT4ExbSYRI?t=34
assert get_min_intersection([90,60,80]) == 30
# The minimum intersection of [30,35,32] out of 50 is 0 according to https://youtu.be/GcT4ExbSYRI?t=251
assert get_min_intersection( [30,35,32], 50) == 0
# The minimum intersection of [40,50,60] out of 100 is 0 according to https://www.handakafunda.com/set-theory-maximum-and-minimum-values/
assert(get_min_intersection( [40,50,60]) == 0)
As @Joao said, the maximum intersection is the minimum of the elements in the set.