Paper Info
Title
A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy.
Abstract
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 independent set of H. We show that the vertex set of every 3-uniform hypergraph H can be covered by at most alpha(H) edge-disjoint linear cycles (where we accept a vertex and a hyperedge as a linear cycle), proving a weaker version of a conjecture of Gyarfas and Sarkozy.
Year
Venue
Field
2018
ELECTRONIC JOURNAL OF COMBINATORICS
Discrete mathematics,Independence number,Cycle cover,Combinatorics,Disjoint sets,Vertex (geometry),Hypergraph,Independent set,Conjecture,Mathematics,The Intersect
DocType
Volume
Issue
Journal
25.0
2.0
ISSN
Citations 
PageRank 
1077-8926
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Beka Ergemlidze102.03
Ervin Györi28821.62
Abhishek Methuku3189.98