A note on the linear cycle cover conjecture of Gyárfás and Sárközy (Q1753119): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1609.04761 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On 3-uniform hypergraphs without linear cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monochromatic loose-cycle partitions in hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5342985 / rank | |||
Normal rank |
Latest revision as of 17:37, 15 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on the linear cycle cover conjecture of Gyárfás and Sárközy |
scientific article |
Statements
A note on the linear cycle cover conjecture of Gyárfás and Sárközy (English)
0 references
25 May 2018
0 references
Summary: 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 \textit{A. Gyárfás} and \textit{G. Sárközy} [Electron. J. Comb. 21, No. 2, Research Paper P2.36, 10 p. (2014; Zbl 1300.05199)].
0 references
loose cycles
0 references
covering
0 references
independence number
0 references