Sciweavers

JCT
2007
95views more  JCT 2007»
13 years 11 months ago
Codegree problems for projective geometries
The codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free r-graphs G on n vertices such that every set of r−1 vertices is contained in at le...
Peter Keevash, Yi Zhao