Sciweavers

JCT
2007
96views more  JCT 2007»
13 years 11 months ago
Co-degree density of hypergraphs
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...
Dhruv Mubayi, Yi Zhao
DM
2008
66views more  DM 2008»
13 years 11 months ago
Constructions of non-principal families in extremal hypergraph theory
A family F of k-graphs is called non-principal if its Tur
Dhruv Mubayi, Oleg Pikhurko