Positive co-degree Turán number for C₅ and C₅^-

2022/12/24 by Zhuo Wu, Wu, Zhuo
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2212.12815

openalex publication_date 2022/12/24 · openalex created_date 2023/01/04 · openalex updated_date 2026/07/28

Abstract

The minimum positive co-degree δ⁺_r-1(H) of a non-empty r-graph H is the maximum k such that if S is an (r-1)-set contained in a hyperedge of H, then S is contained in at least k hyperedges of H. For any r-graph F, the positive degree Turán number co⁺ex(n,F) is defined as the maximum value of δ⁺_r-1(H) over all n-vertex F-free non-empty r-graphs H. In this paper, we determine the positive degree Turán number for C₅ and C₅^-.

Related

• Positive co-degree density of hypergraphs
• Positive co-degree densities and jumps
• On the limit of the positive ℓ-degree Turán problem
• On the Turán number of K_m \vee C_2k-1
• Degree powers in C₅-free graphs