Graph Problem
Source: Simurgh 2019 - Problem 3
February 24, 2019
graphcombinatoricssymmetry
Problem Statement
We call a graph symmetric, if we can put its vertices on the plane such that if the edges are segments, the graph has a reflectional symmetry with respect to a line not passing through its vertices. Find the least value of such that the edges of every graph with vertices, can be divided into symmetric subgraphs.