On intersecting hypergraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4008407 (Why is no real title available?)
- scientific article; zbMATH DE number 3695222 (Why is no real title available?)
- scientific article; zbMATH DE number 3745219 (Why is no real title available?)
- scientific article; zbMATH DE number 3547309 (Why is no real title available?)
- Covering pairs by q^ 2+q+1 sets
- Intersecting designs from linear programming and graphs of diameter two
- On maximal intersecting families of finite sets
Cited in
(11)- Domination in intersecting hypergraphs
- scientific article; zbMATH DE number 4134102 (Why is no real title available?)
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
- Matching critical intersection hypergraphs
- The representation of multi-hypergraphs by set intersections
- Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited
- Mixed interval hypergraphs
- On randomly generated intersecting hypergraphs
- Matching criticality in intersecting hypergraphs
- Hyperideal-based intersection graphs
- Nonintersecting Ryser Hypergraphs
This page was built for publication: On intersecting hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379831)