PowerPoint Slideshow about 'Edge-Coloring Geometric Graphs (Problem 75)' - liza
An Image/Link below is provided (as is) to download presentation
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
For a set of n points in the plane in general position, draw a straight segment between every pair of points. What is the minimum number of colors that suffice to color the edges such that no two edges that cross have the same color?
It has been conjectured that (1 – ε)*n is an upper bound for some ε > 0.