On two intersecting set systems and k-continuous Boolean functions

DOI10.1016/0166-218X(87)90074-6zbMath0615.05001MaRDI QIDQ1820783

Zsolt Tuza

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypergraphBoolean functionfinite setintersecting system

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05)

Related Items (6)

Some Small Circuit-Cocircuit Ramsey Numbers for Matroids ⋮ A sharp bound on the size of a connected matroid ⋮ Lower bound on the profile of degree pairs in cross-intersecting set systems ⋮ On linear and semidefinite programming relaxations for hypergraph matching ⋮ Minimum number of elements of representing a set system of given rank ⋮ On list critical graphs

Cites Work

• Critical hypergraphs and interesting set-pair systems
• Interpolation of functions over a measure space and conjectures about memory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On two intersecting set systems and k-continuous Boolean functions