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 countably infinite independent set, or a clique with the same cardinality as the whole graph.
[1] The theorem was first published by Ben Dushnik and E. W. Miller (1941), in both the form stated above and an equivalent complementary form: every infinite graph contains either a countably infinite clique or an independent set with equal cardinality to the whole graph.
In their paper, they credited Paul Erdős with assistance in its proof.
They applied these results to the comparability graphs of partially ordered sets to show that each partial order contains either a countably infinite antichain or a chain of cardinality equal to the whole order, and that each partial order contains either a countably infinite chain or an antichain of cardinality equal to the whole order.
[2] The same theorem can also be stated as a result in set theory, using the arrow notation of Erdős & Rado (1956), as
This means that, for every set
, and every partition of the ordered pairs of elements of
, there exists either a subset
, such that all pairs of elements of
can be interpreted as the edges of a graph having
as its vertex set, in which
(if it exists) is a clique of cardinality
(if it exists) is a countably infinite independent set.
itself, the theorem can be formulated in terms of ordinal numbers with the notation
(when it exists) has order type
For uncountable regular cardinals
;[4] however, it is consistent that this strengthening does not hold for the cardinality of the continuum.
[5] The Erdős–Dushnik–Miller theorem has been called the first "unbalanced" generalization of Ramsey's theorem, and Paul Erdős's first significant result in set theory.