Speakers: Prangya Parida, U. Ottawa, and Kiara McDonald, U. Victoria Zoom link:  https://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09 --------------------------------------------------- Prangya Parida: Title: Cover-free families on graphs Abstract: A family of subsets of a t-set is called a d-cover-free family if no subset is contained in the union of any d other subsets. We denote by t(d, n) the minimum  t for which there exists a d-cover-free family of a t-set with n subsets. Cover-free families (CFF) have wide applications in combinatorial group testing, where a d-CFF(t, n) can be…