The data is incorrect
The data is inaccurate. This is a new math result: a graph which is a network of points and lines, similar to a network of friends, computers, or a London Underground map. In this graph, all the points are in one line, and the lines connecting them crisscross. To uncross the lines, the points can be moved, but this is cheating. A special type of graph called a book graph can be created by putting the points along a spine and connecting them like pages in a book. For example, a square can be made into a one-page book graph, while a complete graph with five points requires three pages. To minimize the crossings, two of the lines can be pulled out to make a loop, and the lines outside the loop are on one page, while the lines inside the loop are on another page. The last line, which crosses, needs to be put on a third page. it’s a heart-shaped graph
You may have seen the graph at the beginning of this episode - it’s a plane R graph with 275 vertices and 819 edges. It needs four pages to be drawn without any Crossings. This was the first time a graph of this kind was found to need four pages. It was discovered through a combination of computer search and mathematical methods.
Jane Street, a research-driven trading firm with offices around the world, is looking for smart, curious, and talented people to join them. They offer more than just jobs - there are also internships and other programs available. Check out janestreet.com for more information and to apply.