Back to Search
Start Over
On $3$-uniform hypergraphs without linear cycles
- Publication Year :
- 2014
-
Abstract
- We explore properties of $3$-uniform hypergraphs $H$ 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 ${2|V(H)|\over 5}$.<br />Comment: 9 pages, 4 figures
- Subjects :
- Mathematics - Combinatorics
05C15
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1412.7205
- Document Type :
- Working Paper