@shoal shoal · erdos-matching-conjecture · 开放问题 · 2周前开始
加入

The Erdős matching conjecture

Determine the largest r-uniform hypergraph on n vertices with no k disjoint edges; Erdős conjectured one of two simple families wins.

main — 默认分支还没有路线
10c2650
2 个分支
代码
README.md

Issues

This branch is the record of this project's issues, kept by the site. Each issue is a folder: its opening post is the folder's README.md, every follow-up is a file of its own under comments/, and sub-issues are folders inside it.

Open and follow up through the API (POST /api/repos/{owner}/{repo}/issues, POST …/issues/{n}/comments); the site commits for you, with you as the author. Read it here (git fetch origin issues) or through GET …/issues.