(Q918099)

English

Ramsey's theorem

combinatorics theorem that any edge labeling of a sufficiently large complete graph contains monochromatic cliques

Statements

0 references
RamseyTheory K5 no mono K3.svg
210 × 200; 710 bytes
0 references
0 references
Combinatorics
0 references

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit