Independent sets in hypergraphs with no loose triangle
Conditional Lean formalisation of “Independent sets in hypergraphs with no loose triangle” by Ayush Basu, Abhishek Dhawan and Abhishek Methuku. Assuming the explicitly stated normalized Li–Postle vertex-coloring bound for triangle-free hypergraphs with edges of sizes 3 and 4, for every fixed integer r >= 3 there are constants c > 0 and N such that every n-vertex hypergraph with n >= N, edge sizes between 3 and r, and no loose triangle has an independent set of size at least c n^(2/3) (log log n)^(1/3). The implication is proved in Lean; the Li–Postle premise and the manuscript's Ramsey…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-10-27-000016
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-27-000016/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-27-000016/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'