On the Linear Cycle Cover Conjecture of Gyárfás and Sárközy

preprint2016arXivOpen access

Abstract

A linear cycle in a hypergraph HH is a cyclic sequence of hyperedges such that two consecutive hyperedges intersect in exactly one element and two nonconsecutive hyperedges are disjoint and α(H)α(H) denotes the size of a largest independent set of HH. In this note, we show that the vertex set of every 33-uniform hypergraph HH can be covered by at most α(H)α(H) pairwise edge-disjoint linear cycles (where we accept a vertex and a hyperedge as a linear cycle), proving a weaker version of a conjecture of Gyárfás and Sárközy.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.