The maximum number of subset divisors of a given size
From MaRDI portal
Publication:267196
DOI10.1016/J.DISC.2016.01.025zbMATH Open1333.05308arXiv1407.4720OpenAlexW2236049392MaRDI QIDQ267196FDOQ267196
Authors: Samuel Zbarsky
Publication date: 8 April 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: If is a positive integer and is a set of positive integers, we say that is an -divisor of if . We study the maximal number of -subsets of an -element set that can be -divisors. We provide a counterexample to a conjecture of Huynh that for , the answer is with only finitely many exceptions, but prove that adding a necessary condition makes this true. Moreover, we show that under a similar condition, the answer is with only finitely many exceptions for each .
Full work available at URL: https://arxiv.org/abs/1407.4720
Recommendations
Cites Work
- Product partial orders with the Sperner property
- A linear bound on the Manickam-Miklós-Singhi conjecture
- Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture
- Title not available (Why is that?)
- Cube Slicing in R n
- Title not available (Why is that?)
- Extremal problems for subset divisors
- Title not available (Why is that?)
- The Manickam-Miklós-Singhi conjectures for sets and vector spaces
Cited In (3)
This page was built for publication: The maximum number of subset divisors of a given size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q267196)