olymmath

RO-TST 2008 Problem 9

    Let GG be a connected graph with nn vertices and mm edges such that each edge is contained in at least one triangle. Find the minimum value of mm .

    Dataset text AI-MO AoPS. Quoted with source.

    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 ro-tst/2008/p9 · Tag 235RX9NK93 · Edit this page on GitHub · Keys: j next, k previous