cover free families
Recently Published Documents


TOTAL DOCUMENTS

26
(FIVE YEARS 0)

H-INDEX

7
(FIVE YEARS 0)



2020 ◽  
Vol 343 (10) ◽  
pp. 112027
Author(s):  
Noga Alon ◽  
Shoni Gilboa ◽  
Shay Gueron
Keyword(s):  


2019 ◽  
Vol 13 (4) ◽  
pp. 629-643 ◽  
Author(s):  
Thais Bardini Idalino ◽  
◽  
Lucia Moura
Keyword(s):  


Author(s):  
Nader H. Bshouty ◽  
Ariel Gabizon
Keyword(s):  


10.37236/5202 ◽  
2016 ◽  
Vol 23 (2) ◽  
Author(s):  
Ali Z. Abdi ◽  
Nader H. Bshouty

Let ${\cal F}$ be a set of blocks of a $t$-set $X$. A pair $(X,{\cal F})$ is called an $(w,r)$-cover-free family ($(w,r)-$CFF) provided that, the intersection of any $w$ blocks in ${\cal F}$ is not contained in the union of any other $r$ blocks in ${\cal F}$.We give new asymptotic lower bounds for the number of minimum points $t$ in a $(w,r)$-CFF when $w\le r=|{\cal F}|^\epsilon$ for some constant $\epsilon\ge 1/2$. 





2015 ◽  
Vol 22 (7) ◽  
pp. 677-686
Author(s):  
Huilan Chang ◽  
Yi-Chang Chiu ◽  
Yi-Lin Tsai
Keyword(s):  


2012 ◽  
Vol Vol. 14 no. 2 (Graph Theory) ◽  
Author(s):  
Hossein Hajiabolhassan ◽  
Farokhlagha Moazami

Graph Theory International audience For a binary code Γ of length v, a v-word w produces by a set of codewords {w1,...,wr}⊆Γ if for all i=1,...,v, we have wi∈{w1i,...,wri} . We call a code r-secure frameproof of size t if |Γ|=t and for any v-word that is produced by two sets C1 and C2 of size at most r then the intersection of these sets is nonempty. A d-biclique cover of size v of a graph G is a collection of v-complete bipartite subgraphs of G such that each edge of G belongs to at least d of these complete bipartite subgraphs. In this paper, we show that for t≥2r, an r-secure frameproof code of size t and length v exists if and only if there exists a 1-biclique cover of size v for the Kneser graph KG(t,r) whose vertices are all r-subsets of a t-element set and two r-subsets are adjacent if their intersection is empty. Then we investigate some connection between the minimum size of d-biclique covers of Kneser graphs and cover-free families, where an (r,w;d) cover-free family is a family of subsets of a finite set such that the intersection of any r members of the family contains at least d elements that are not in the union of any other w members. Also, we present an upper bound for 1-biclique covering number of Kneser graphs.



2012 ◽  
Vol 312 (24) ◽  
pp. 3626-3635 ◽  
Author(s):  
Hossein Hajiabolhassan ◽  
Farokhlagha Moazami
Keyword(s):  


Sign in / Sign up

Export Citation Format

Share Document