olymmath

Nemotron-IMO-Bench 2026 C24

    A triangle-free graph on nn vertices and having maximal degree ≤d\leq d has an independent set of size at least log⁡2d8dn\frac{\log_2 d}{8d}n.

    Dataset text Nemotron-IMO-Bench. Open licence.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator nemotron-imo-bench/2026/c24 · Tag 5EG3EK3V1J · Edit this page on GitHub · Keys: j next, k previous