Erdős–Dushnik–Miller theorem
id:
erd-s-dushnik-miller-theorem-250-2953904
title:
Erdős–Dushnik–Miller theorem
text:
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. 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 cardin
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93Dushnik%E2%80%93Miller_theorem
date created:
date modified:
2022-05-11T05:34:01Z
main entity:
{"identifier":"Q96377355","url":"https://www.wikidata.org/entity/Q96377355"}
image:
fields total:
13
integrity:
13