Positive Co‐Degree Turán Number for <i>C</i><sub>5</sub> and <i>C</i><sub>5</sub><sup>−</sup>
ABSTRACT The minimum positive co‐degree of a nonempty ‐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 positive degree Turán number is defined as the maximum value of over all ‐vertex ‐free nonempty ‐graphs . In this paper, we determine the positive degree Turán number for and .
Authors
- Zhuo Wu (ORCID: https://orcid.org/0000-0001-7753-9571)
Institutions
- University of Warwick (GB)
Publication Details
- Journal
- Journal of Graph Theory
- Published
- 2024-12-30
- DOI
- https://doi.org/10.1002/jgt.23206
- Citations
- 1
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 1.32
Funders
- University of Warwick
- Institute for Basic Science