Inequalities for two set systems with prescribed intersections

DOI10.1007/BF01788531zbMath0622.05006MaRDI QIDQ1090680

Zsolt Tuza

Publication date: 1987

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

inequalitiespairs of finite sets

Mathematics Subject Classification ID

Combinatorial inequalities (05A20)

Related Items (13)

Combinatorics in the exterior algebra and the Bollobás Two Families Theorem ⋮ The minimum number of vertices in uniform hypergraphs with given domination number ⋮ Hypergraph coverings and local colorings ⋮ Set systems related to a house allocation problem ⋮ Vector sum-intersection theorems ⋮ Bounded degrees and prescribed distances in graphs ⋮ Some new bounds for cover-free families through biclique covers ⋮ Interval Packing and Covering in the Boolean Lattice ⋮ On directed local chromatic number, shift graphs, and Borsuk-like graphs ⋮ Matchings and covers in hypergraphs ⋮ Bollobás-type theorems for hemi-bundled two families ⋮ On $k$-Neighbor Separated Permutations ⋮ On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method

Cites Work

• Intersection patterns of convex sets
• Helly-type hypergraphs and Sperner families
• Hypergraphs without a large star
• A simple proof of the upper bound theorem
• Critical hypergraphs and interesting set-pair systems
• An extremal problem for two families of sets
• Mutually disjoint families of 0-1 sequences
• On two Combinatorial Problems Arising from Automata Theory
• On generalized graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inequalities for two set systems with prescribed intersections