加载中…
The \emph{minimum positive co-degree} of a non-empty -graph is the maximum such that if is an -set contained in a hyperedge of , then is contained in at least hyperedges of . For any -graph , the \emph{positive degree Turán number} is defined as the maximum value of over all -vertex -free non-empty -graphs . In this paper, we determine the positive degree Turán number for and .

生成讲解博客的中文版本

生成AI智能校验的中文版本