Library / /40 of 151

, 2020

Combinatorics Difficulty 6.0 National Olympiad Prove it Hungary

Finite graph $G(V,E)$ on $n$ points is drawn in the plane. For an edge $e$ of the graph let $x(e)$ denote the number of edges that cross over edge $e$ . Prove that

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.