JCT
2007
13 years 4 months ago
2007
For an r-graph H, let C(H) = minS d(S), where the minimum is taken over all (r − 1)-sets of vertices of H, and d(S) is the number of vertices v such that S ∪ {v} is an edge of...
DM
2008
13 years 4 months ago
2008
A family F of k-graphs is called non-principal if its Tur