Gallai–Ramsey theory lies at the intersection of graph colouring and Ramsey theory, providing a framework for understanding how structures emerge in edge-coloured graphs. Central to this domain is the ...
Problem: How many colors are needed so that if each point in the plane is assigned one of the colors, no two points which are exactly distance 1 apart will be assigned the same color? This problem has ...
A drawing of a graph G in the plane has the vertices represented by distinct points and the edges represented by polygonal lines joining their endpoints such that: no edge contains a vertex other than ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results