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)

Full work available at URL https://doi.org/10.1007/BF01410753

zbMATH Keywords

forestindependent setsuniform hypergraphs

Mathematics Subject Classification ID

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

Review text

Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 114, 196-204 (Russian) (1982; Zbl 0499.05045).

Cited in

(6)

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

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)