benchmarks.wiki / Public workspace

Omni-MATH / How many graphs are there on 10 vertices labeled 1,2,…,10 such that there are exactly 23 edges and no triangles?

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

How many graphs are there on 10 vertices labeled 1,2,…,101,2, \ldots, 10 such that there are exactly 23 edges and no triangles?
Plain-text mathematical notation (without MathML)
How many graphs are there on 10 vertices labeled 1,2,…,10 such that there are exactly 23 edges and no triangles?
Original LaTeX notation
How many graphs are there on 10 vertices labeled \(1,2, \ldots, 10\) such that there are exactly 23 edges and no triangles?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import