The even squarefree numbers form a maximum independent set in the squarefree graph, and the graph's vertices can be partitioned into cliques, each containing exactly one even vertex.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The independence and clique cover numbers of the squarefree graph
The even squarefree numbers form a maximum independent set in the squarefree graph, and the graph's vertices can be partitioned into cliques, each containing exactly one even vertex.