On $3$-uniform hypergraphs without linear cycles
Combinatorics
2014-12-24 v1
Abstract
We explore properties of -uniform hypergraphs without linear cycles. Our main results are that these hypergraphs must contain a vertex of strong degree at most two and must have independent sets of size at least .
Keywords
Cite
@article{arxiv.1412.7205,
title = {On $3$-uniform hypergraphs without linear cycles},
author = {András Gyárfás and Ervin Győri and Miklós Simonovits},
journal= {arXiv preprint arXiv:1412.7205},
year = {2014}
}
Comments
9 pages, 4 figures