On 3-uniform hypergraphs without linear cycles
From MaRDI portal
Publication:5963391
DOI10.4310/JOC.2016.V7.N1.A8zbMATH Open1331.05162arXiv1412.7205OpenAlexW2963847949MaRDI QIDQ5963391FDOQ5963391
Ervin Győri, Miklós Simonovits, András Gyárfás
Publication date: 19 February 2016
Published in: Journal of Combinatorics (Search for Journal in Brave)
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 .
Full work available at URL: https://arxiv.org/abs/1412.7205
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 (10)
- On the size of 3-uniform linear hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- A note on the linear cycle cover conjecture of Gyárfás and Sárközy
- 3-uniform hypergraphs without a cycle of length five
- Odd cycles and \(\Theta\)-cycles in hypergraphs
- Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
- Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
- 3-uniform hypergraphs and linear cycles
- 3-Uniform Hypergraphs and Linear Cycles
- On 3-uniform hypergraphs without a cycle of a given length
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)
