Sets of integers avoiding congruent subsets
Rafael Tesoro

TL;DR
This paper investigates sets of integers that avoid certain congruent subsets, refining previous results by Erdős and Harzheim on the structure and properties of such sets.
Contribution
It provides improved bounds and new insights into the structure of integer sets avoiding congruent subsets, advancing the understanding of their combinatorial properties.
Findings
Refined bounds on the size of sets avoiding congruent subsets
New structural characterizations of such sets
Enhanced understanding of their combinatorial properties
Abstract
Consider the sets of integers that avoid any arrangement of congruent -subsets. Our findings refine and improve upon some results by Erd\H{o}s and Harzheim about these sets.
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
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Advanced Topology and Set Theory
