Some new bounds for cover-free families through biclique covers

DOI10.1016/j.disc.2012.08.016zbMath1256.05187arXiv1008.3691OpenAlexW2047840070MaRDI QIDQ1759404

Hossein Hajiabolhassan, Farokhlagha Moazami

Publication date: 20 November 2012

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

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

zbMATH Keywords

cover-free familybiclique coverfractional biclique coverweakly cross-intersecting set-pairs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

The rectangle covering number of random Boolean matrices ⋮ On the biclique cover of the complete graph ⋮ Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) ⋮ Biclique cover and local clique cover of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• Separating systems and oriented graphs of diameter two
• On separating systems
• Families of finite sets in which no set is covered by the union of \(r\) others
• Inequalities for two set systems with prescribed intersections
• Key storage in secure networks
• Families of finite sets in which no set is covered by the union of two others
• On the ratio of optimal integral and fractional covers
• On the upper bound of the size of the \(r\)-cover-free families
• Covering a graph by complete bipartite graphs
• Generalized cover-free families.
• On the optimality of trivial \((w,r)\)-cover-free codes
• On a bound of cover-free families
• On \(r\)-cover-free families
• Some new bounds for cover-free families
• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• On biclique coverings
• Interval Packing and Covering in the Boolean Lattice
• Nonrandom binary superimposed codes
• On generalized graphs
• Minimal completely separating systems

This page was built for publication: Some new bounds for cover-free families through biclique covers