Independence in hypergraphs

DOI10.1007/BF01410753MaRDI QIDQ762178zbMATH OpenFDO

Authors Yu. A. Sushkov

Publication date 1984

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

uniform hypergraphsforestindependent sets

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of matroids and geometric lattices (05B35) Hypergraphs (05C65)

Cited in

(6)

• Hypergraph Independent Sets
• Independence and Matchings in $\sigma$-hypergraphs
• Independence and graph homomorphisms graph homomorphisms
• Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs
• On freedom and independence in hypergraphs of models of theories
• Independence in function graphs

This page was built for publication: Independence in hypergraphs

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