Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 844

../

claims/: The 2 claim pages of Problem 844, one per claimant's result; the problem's standing derives from them.


Statement. Let A⊆{1,…,N}A\subseteq \{1,\ldots,N\} be such that, for all a,b∈Aa,b\in A, the product abab is not squarefree.

Is the maximum size of such an AA achieved by taking AA to be the set of even numbers and odd non-squarefree numbers?

Status. PROVED (LEAN).

Source. erdosproblems.com/844, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #844, https://www.erdosproblems.com/844.

References.

  • [AMS25] B. Alexeev, D. Mixon, and W. Sawin, The independence and clique cover numbers of the squarefree graph. arXiv:2507.01928 (2025).
  • [Ch74] Chvátal, V., Intersecting families of edges in hypergraphs having the hereditary property. (1974), 61-66.
  • [Er92b] Erdős, P., Some of my favourite problems in various branches of combinatorics. Matematiche (Catania) 47 (1992), no. 2, 231--240.

Formalization. Statement in formal-conjectures.

Current assessment

The site's formulation of 2026-09-04 asks whether the even numbers together with the odd non-squarefree numbers form a largest set up to NN with no squarefree pairwise product. Two accepted claims answer yes: Weisenberg's reduction to Chvátal's 1974 theorem on intersecting subfamilies of a family closed under left shifts, and the independent clique-partition proof of Alexeev, Mixon and Sawin (arXiv, July 2025). Asymptotically the maximum has (1−4/π2+o(1))N(1-4/\pi^2+o(1))N elements. A Lean 4 proof along Weisenberg's route, produced with Aristotle and posted on the site's thread on 26 April 2026, is linked from his claim page; this corpus did not build it.

Chvátal's theorem is transcribed on its library card with its proof unchecked, and the Alexeev--Mixon--Sawin paper is digested on its card; neither proof is compiled here and no independent review is recorded. The problem is a 1992 question of Erdős and Sárközy [Er92b]; Problem 701 is Chvátal's conjecture, the hereditary-family generalization of the theorem used here.

Linked library material

These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.