On a Problem of Erd\H{o}s, Herzog and Sch\"onheim
Yong-Gao Chen, Cui-Ying Hu

TL;DR
This paper solves a problem posed by Erdős, Herzog, and Schönheim regarding the characterization of divisor sets with specific coprimality constraints, providing a complete solution and proposing open questions.
Contribution
The paper fully characterizes the divisor sets that attain the minimal size bound under the given coprimality conditions, advancing understanding of divisor set structures.
Findings
Characterization of divisor sets meeting the minimal size bound.
Proof of the structure of extremal divisor sets.
Presentation of open problems for future research.
Abstract
Let be distinct primes. In 1970, Erd\H os, Herzog and Sch\"{o}nheim proved that if is a set of divisors of , , no two members of the set being coprime and if no additional member may be included in without contradicting this requirement then . They asked to determine all sets such that the equality holds. In this paper we solve this problem. We also pose several open problems for further research.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
