A note on cover-free families

MaRDI QIDQ4576347zbMATH OpenFDO

Authors Mehdi Azadimotlagh

Publication date 12 July 2018

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

zbMATH Keywords

cover-free familiesbiclique covering number

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Abstract: Let N((r,w;d),t) denote the minimum number of points in a (r,w;d)-cover-free family having t blocks. Hajiabolhassan and Moazami (2012)[6] showed that the Hadamard conjecture is equivalent to confirm N((1,1;d)4d-1)=4d-1. Hence, it is a challenging and interesting problem to determine the exact value of N((r,w;d),t). In this paper, we determine the exact value of N((r,w;d),t) for every r, w, where r+w<t+1 and some d.

Recommendations

• Some new bounds for cover-free families through biclique covers
• Some new bounds for cover-free families
• A generalization of \((2,w;d)\)-cover free families.
• Lower bounds for cover-free families
• Constructions of 2-cover-free families and related separating hash families

Cited in

(3)

• Some new bounds for cover-free families through biclique covers
• A note on tameness of families having bounded variation
• A note on the size of \(\mathscr{N}\)-free families

This page was built for publication: A note on cover-free families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576347)