Co-degree density of hypergraphs |
| |
| Authors: | Dhruv Mubayi Yi Zhao |
| |
| Institution: | a Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL 60607, USA
b Department of Mathematics and Statistics, Georgia State University, Atlanta, GA 30303, USA |
| |
| Abstract: | For an r-graph H, let C(H)=minSd(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 H. Given a family F of r-graphs, the co-degree Turán number  is the maximum of C(H) among all r-graphs H which contain no member of F as a subhypergraph. Define the co-degree density of a family F to be |
| |
| Keywords: | Codegree Jump constant Hypergraph Extremal problem |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
