62
Voted
DM
2016
10 years 1 months ago
2016
A set partition σ of [n] = {1, . . . , n} contains another set partition π if restricting σ to some S ⊆ [n] and then standardizing the result gives π. Otherwise we say σ av...
70
Voted
DM
2016
10 years 1 months ago
2016
A family A of sets is t-intersecting if the size of the intersection of every pair of sets in A is at least t, and it is an r-family if every set in A has size r. A wellknown theor...
68
Voted
DM
2016
10 years 1 months ago
2016
71
Voted
DM
2016
10 years 1 months ago
2016
69
Voted
DM
2016
10 years 1 months ago
2016
Abstract. We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for...