Simple hypergraphs with maximal number of adjacent pairs of edges

DOI10.1016/0095-8956(80)90062-3zbMath0441.05036OpenAlexW2094590317WikidataQ105583538 ScholiaQ105583538MaRDI QIDQ1142787

No author found.

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://pub.uni-bielefeld.de/record/1780400

zbMATH Keywords

hypergraphadjacent pairs of edges

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (8)

Applications of graph containers in the Boolean lattice ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ A note on supersaturated set systems ⋮ Probably Intersecting Families are Not Nested ⋮ The minimum number of disjoint pairs in set systems and related problems ⋮ Disjoint pairs in set systems with restricted intersection ⋮ Fractional set systems with few disjoint pairs ⋮ Most probably intersecting hypergraphs

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Graphs with maximal number of adjacent pairs of edges
• Unnamed Item
• Unnamed Item

This page was built for publication: Simple hypergraphs with maximal number of adjacent pairs of edges