A generalization of the Bollobás set pairs inequality

DOI10.37236/9627zbMath1467.05261arXiv1812.00537OpenAlexW3177982278MaRDI QIDQ2040005

Jason O'Neill, Jacques Verstraete

Publication date: 6 July 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.00537

zbMATH Keywords

Bollobás set pairshypergraph covering problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (2)

Weakly saturated hypergraphs and a conjecture of Tuza ⋮ A note on \(k\)-wise oddtown problems

Cites Work

• Geometrical solution of an intersection problem for two hypergraphs
• A simple proof of the upper bound theorem
• Critical hypergraphs and interesting set-pair systems
• New bounds for perfect hashing via information theory
• An extremal problem for two families of sets
• On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families
• Solution of a problem of A. Ehrenfeucht and J. Mycielski
• A new Bollobás-type inequality and applications to \(t\)-intersecting families of sets
• Exact bounds for some hypergraph saturation problems
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Counting Intersecting and Pairs of Cross-Intersecting Families
• Beating Fredman-Komlós for Perfect k-Hashing.
• A Problem in Graph Theory
• The Representation of a Graph by Set Intersections
• On generalized graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalization of the Bollobás set pairs inequality