2023/11/07 by Alexander Sidorenko, Sidorenko, Alexander
Engineering · Business, Management and Accounting · #graph theory and CDMA systems #Consumer Market Behavior and Pricing #Optimization and Packing Problems
paper · pdf · doi:10.48550/arxiv.2311.04086
Let A and B be disjoint sets of sizes a and b, respectively. Let f(a,b) denote the minimum number of quadruples needed to cover all triples T ⊆ A ∪ B such that |T ∩ A| ≥ 2. We prove upper and lower bounds on f(a,b) and use them to derive upper bounds for the (n,4,3,4)-lottery problem.