Independence in hypergraphs

DOI10.1007/BF01410753zbMATH Open0557.05053MaRDI QIDQ762178FDOQ762178

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

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

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)