On the Codegree Density of Complete 3-Graphs and Related Problems

[摘要] Given a 3-graph $F$, its codegree threshold $\textrm{co-ex}(n, F)$ is the largest number $d=d(n)$ such that there exists an $n$-vertex 3-graph in which every pair of vertices is contained in at least $d$ triples but which contains no member of $F$ as a su

[学科分类] 离散数学和组合数学

[关键词] Extremal hypergraph theory;codegree density