Independence in uniform linear triangle-free hypergraphs

DOI10.1016/J.DISC.2016.01.006zbMath1334.05091arXiv1507.04323OpenAlexW1918183363WikidataQ62043605 ScholiaQ62043605MaRDI QIDQ279201

Piotr Borowiecki, Dieter Rautenbach, Michael Gentner, Christian Löwenstein

Publication date: 27 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

independencehypergraphlineartriangle-freedouble linearuniform

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• On vertex independence number of uniform hypergraphs
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• Extremal uncrowded hypergraphs
• A note on the independence number of triangle-free graphs. II
• Improved lower bounds on k‐independence
• A lower bound on the independence number of arbitrary hypergraphs
• The potential of greed for independence
• On uncrowded hypergraphs
• New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs
• On independent sets in hypergraphs
• Differential Methods for Finding Independent Sets in Hypergraphs

This page was built for publication: Independence in uniform linear triangle-free hypergraphs