English Erdős–Dushnik–Miller theorem Cited by user Citation bot on 19 Sep 2024 In the mathematical theory of infinite graphs, the Erdős–Dushnik–Miller theorem is a form of Ramsey's theorem stating that every infinite graph contains either a…
English Erdős–Hajnal conjecture Cited by user Citation bot on 08 May 2024 In graph theory, a branch of mathematics, the Erdős–Hajnal conjecture states that families of graphs defined by forbidden induced subgraphs have either large cliques or…
French Conjecture d'Erdős-Hajnal Cited by user ManiacParisien on 15 Sep 2021 En théorie des graphes, la conjecture d'Erdős-Hajnal concerne une relation entre les sous-graphes induits et les cliques et stables.