On $3$ -uniform hypergraphs without linear cycles

preprint2014arXivOpen access

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}$ .

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.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

On $3$ -uniform hypergraphs without linear cycles

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

On 333-uniform hypergraphs without linear cycles

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

On $3$ -uniform hypergraphs without linear cycles