Positive co-degree Tur\'an number for $C_5$ and $C_5^{-}$
Combinatorics
2022-12-27 v1
Abstract
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\'an number} is defined as the maximum value of over all -vertex -free non-empty -graphs . In this paper, we determine the positive degree Tur\'an number for and .
Cite
@article{arxiv.2212.12815,
title = {Positive co-degree Tur\'an number for $C_5$ and $C_5^{-}$},
author = {Zhuo Wu},
journal= {arXiv preprint arXiv:2212.12815},
year = {2022}
}
Comments
8 pages