The independence and clique cover numbers of the squarefree graph
Abstract
We determine the largest subset A⊂eq \1,…c,n\ such that for all a,b∈ A, the product ab is not squarefree. Specifically, the maximum size is achieved by the complement of the odd squarefree numbers. This resolves a problem of Paul Erdos and Andr\'as S\'ark\"ozy from 1992.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.