The Erdős–Hajnal conjecture is a famous conjecture in combinatorial set theory and graph theory, proposed by mathematicians Paul Erdős and András Hajnal in the early 1970s. It addresses the structure of graphs that do not contain certain types of subgraphs, specifically focusing on the clique and independent set sizes.
Articles by others on the same topic
There are currently no matching articles.