On 3-uniform hypergraphs without linear cycles

DOI10.4310/JOC.2016.V7.N1.A8MaRDI QIDQ5963391zbMATH OpenOpenAlexFDO

Authors András Gyárfás, Ervin Győri, Miklós Simonovits

Publication date 19 February 2016

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1412.7205

zbMATH Keywords

independent sets in hypergraphscycles in hypergraphslinear cycles

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Triple systems (05B07)

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)|over5$.

Recommendations

• On 3-uniform hypergraphs without a cycle of a given length
• 3-uniform hypergraphs and linear cycles
• 3-uniform hypergraphs and linear cycles
• On coloring uniform hypergraphs without 3-cycles
• 3-uniform hypergraphs without a cycle of length five
• On the size of 3-uniform linear hypergraphs
• On line graphs of linear 3-uniform hypergraphs
• 3-uniform hypergraphs avoiding a given odd cycle
• Cycle decompositions in 3-uniform hypergraphs
• scientific article; zbMATH DE number 2107052

Cited in

(12)

• Crowns in linear \(3\)-graphs of minimum degree \(4\)
• 3-uniform hypergraphs without a cycle of length five
• Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
• On the size of 3-uniform linear hypergraphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Odd cycles and \(\Theta\)-cycles in hypergraphs
• 3-uniform hypergraphs and linear cycles
• On the feedback number of 3-uniform hypergraphs
• On 3-uniform hypergraphs without a cycle of a given length
• A note on the linear cycle cover conjecture of Gyárfás and Sárközy
• Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
• 3-uniform hypergraphs and linear cycles

This page was built for publication: On 3-uniform hypergraphs without linear cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963391)