Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Ramsey's theorem · Vinony

EntityQ918099· pop 20· linked from 85 articles

Ramsey's theorem

Sign in to save

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

Connections

Frank P. Ramsey

Zermelo–Fraenkel set theory

reverse mathematics

infinitary combinatorics

International Standard Book Number

digital object identifier

International Standard Serial Number

mathematical induction

Categories

Ramsey theory Theorems in graph theory

Sources

wikipedia.externallinksexternallink

What links here85 pages

probabilistic method

Erdős–Burr conjecture

claw-free graph

Büchi automaton

Fulkerson Prize

pigeonhole principle

theorem on friends and strangers

infinitary combinatorics

Erdős–Szekeres theorem

undecidable problem

Erdős–Rado theorem

Paris–Harrington theorem

Gödel's incompleteness theorems

Van der Waerden number

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

crossing number

Entitydist 0.58

game complexity

Entitydist 0.62

Holland's schema theorem

Entitydist 0.62

combinatorial explosion

Entitydist 0.65

Entitydist 0.69

Entitydist 0.69

Stirling permutation

Entitydist 0.69

Category:Combinatorial game theory

Entitydist 0.69

European Prize in Combinatorics

Entitydist 0.70

Le Cam's theorem

Entitydist 0.70

inclusion–exclusion principle

Entitydist 0.70

Stirling number of the second kind

Entitydist 0.71