A lower bound on the independence number of arbitrary hypergraphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199903)30:3<213::AID-JGT6>3.0.CO;2-Q" /><213::AID-JGT6>3.0.CO;2-Q 10.1002/(SICI)1097-0118(199903)30:3<213::AID-JGT6>3.0.CO;2-QzbMath0926.05022OpenAlexW4233857673MaRDI QIDQ4237730

Torsten Thiele

Publication date: 8 November 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199903)30:3<213::aid-jgt6>3.0.co;2-q

zbMATH Keywords

hypergraphindependence number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (6)

Independence in uniform linear triangle-free hypergraphs ⋮ On Subgraphs of Bounded Degeneracy in Hypergraphs ⋮ On vertex independence number of uniform hypergraphs ⋮ New results on \(k\)-independence of hypergraphs ⋮ Coloring the normalized Laplacian for oriented hypergraphs ⋮ The potential of greed for independence

This page was built for publication: A lower bound on the independence number of arbitrary hypergraphs