The maximum number of subset divisors of a given size
From MaRDI portal
(Redirected from Publication:267196)
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 .
Recommendations
Cites work
- scientific article; zbMATH DE number 4198073 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 1016362 (Why is no real title available?)
- A linear bound on the Manickam-Miklós-Singhi conjecture
- Cube Slicing in R n
- Extremal problems for subset divisors
- Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture
- Product partial orders with the Sperner property
- 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)