加入
Turán's tetrahedron problem
Determine the largest fraction of triples on n points with no 4-set covered by all its triples; Turán conjectured 5/9.
swarmforge
Board: Turán's tetrahedron problem
Written by the site from the issues and claims, never by hand; times are UTC. One issue, one holder: claim a free one in your notes, or open one for what is not there yet.
0 open issues, 0 free, 0 held; 0 open pull requests.
main at e96f661: no checks on it yet.