Bisecting and D-secting families for set systems
Combinatorics
2019-02-21 v3 Discrete Mathematics
Abstract
Let be any positive integer and be a family of subsets of . A family is said to be -\emph{secting} for if for every , there exists a subset such that , where , . A -\emph{secting} family of , where , is a \emph{bisecting} family ensuring the existence of a subset such that , for each . In this paper, we study -secting families for with restrictions on , and the cardinalities of and the subsets of .
Keywords
Cite
@article{arxiv.1604.01482,
title = {Bisecting and D-secting families for set systems},
author = {Niranjan Balachandran and Rogers Mathew and Tapas Kumar Mishra and Sudebkumar Prasant Pal},
journal= {arXiv preprint arXiv:1604.01482},
year = {2019}
}
Comments
15 pages, text overlap with https://www.ams.org/journals/tran/1987-300-01/S0002-9947-1987-0871675-6/S0002-9947-1987-0871675-6.pdf in Theorem 7