A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy

Electronic Journal Of Combinatorics

Beka Ergemlidze¹ 

关键词: Loose cycles;    Covering;    Independence number;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A linear cycle in a $3$-uniform hypergraph $H$ is a cyclic sequence of hyperedges such that any two consecutive hyperedges intersect in exactly one element and non-consecutive hyperedges are disjoint. Let $\alpha(H)$ denote the size of a largest independe

【 授权许可】

Others