MathDB
Miklós Schweitzer 2004, Problem 3

Source: Miklós Schweitzer 2004

July 30, 2016
college contestsMiklos Schweitzerratiograph theory

Problem Statement

Prove that there is a constant c>0c>0 such that for any n>3n>3 there exists a planar graph GG with nn vertices such that every straight-edged plane embedding of GG has a pair of edges with ratio of lengths at least cncn.
Back to ProblemsView on AoPS