Disjoint edges in separated hypergraphs

MaRDI QIDQ2445085zbMATH OpenFDO

Authors Peter Frankl

Publication date 11 April 2014

Published in Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

zbMATH Keywords

hypergraphmatching numberfinite family of setspairwise disjoint edges

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Recommendations

• Hypergraphs in which all disjoint pairs have distinct unions
• On families with bounded matching number
• Shattered matchings in intersecting hypergraphs
• INTERSECTING FAMILIES OF SEPARATED SETS
• The maximum number of disjoint pairs in a family of subsets

Cited in

(10)

• On the number of edges of separated multigraphs
• Hypergraphs of Bounded Disjointness
• Shattered matchings in intersecting hypergraphs
• Hypergraphs in which all disjoint pairs have distinct unions
• Disjoint edges in complete topological graphs
• Many disjoint edges in topological graphs
• Integer sequences without singleton intersection
• Isomorphic edge disjoint subgraphs of hypergraphs
• Disjoint edges in geometric graphs
• Disjoint edges in geometric graphs

This page was built for publication: Disjoint edges in separated hypergraphs

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