olymmath

IR-TST 2022 Problem 9

    consider n≥6n\geq 6 points x1,x2,…,xnx_1,x_2,\dots,x_n on the plane such that no three of them are colinear. We call graph with vertices x1,x2,…,xnx_1,x_2,\dots,x_n a "road network" if it is connected, each edge is a line segment, and no two edges intersect each other at points other than the vertices. Prove that there are three road networks G1,G2,G3G_1,G_2,G_3 such that GiG_i and GjG_j don't have a common edge for 1≤i,j≤31\leq i,j\leq 3 .

    Proposed by Morteza Saghafian

    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 ir-tst/2022/p9 · Tag QR322CC6H0 · Edit this page on GitHub · Keys: j next, k previous