Erdős–Dushnik–Miller theorem

The Erdős–Dushnik–Miller theorem is a result in the field of graph theory, specifically in relation to the coloring of graphs. The theorem addresses the concept of coloring infinite graphs, particularly the problem of how many colors are needed to color an infinite graph such that no two adjacent vertices share the same color.