A note on the caro-tuza bound on the independence number of uniform hypergraphs

MaRDI QIDQ3166114zbMATHFDO

Authors Béla Csaba, Thomas A. Plick, Ali Shokoufandeh

Publication date 21 October 2012

zbMATH Keywords

lower boundEuler-Mascheroni constantindependence number\(K\)-uniform hypergraph

Mathematics Subject Classification ID

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

Recommendations

• New lower bounds for the independence number of sparse graphs and hypergraphs
• A lower bound on the independence number of arbitrary hypergraphs
• Independence in 5-uniform hypergraphs
• On vertex independence number of uniform hypergraphs
• Independence in uniform linear triangle-free hypergraphs

Cited in

(4)

• New results on \(k\)-independence of hypergraphs
• On vertex independence number of uniform hypergraphs
• New lower bounds for the independence number of sparse graphs and hypergraphs
• A new lower bound on the independence number of a graph and applications

This page was built for publication: A note on the caro-tuza bound on the independence number of uniform hypergraphs

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