On two intersecting set systems and k-continuous Boolean functions
From MaRDI portal
Publication:1820783
DOI10.1016/0166-218X(87)90074-6zbMath0615.05001MaRDI QIDQ1820783
Publication date: 1987
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Some Small Circuit-Cocircuit Ramsey Numbers for Matroids, On linear and semidefinite programming relaxations for hypergraph matching, On list critical graphs, Minimum number of elements of representing a set system of given rank, Lower bound on the profile of degree pairs in cross-intersecting set systems, A sharp bound on the size of a connected matroid
Cites Work