Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Search

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

Erdős–Ko–Rado theorem · Vinony

🌐English

English Deutsch Español Français Português Türkçe 中文日本語

EntityQ718875· pop 6· linked from 29 articles

Erdős–Ko–Rado theorem

theorem on the maximum size of a family of pairwise intersecting sets

Available in 6 languages

Español
Français
Deutsch
日本語
Hungarian

via Wikidata sitelinks · CC0

Connections

independent set

Categories

Extremal combinatorics Factorial and binomial topics Families of sets Intersection Paul Erdős Theorems in discrete mathematics

Sources

wikipedia.externallinksexternallink

International Standard Book Number

Entity

University of Cambridge

digital object identifier

probability theory

mathematical induction

University of Manchester

binomial coefficient

Sign in to save

Similar entities

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

Entitydist 0.54

Erdős–Faber–Lovász conjecture

Entitydist 0.54

Turán's theorem

Entitydist 0.56

Entitydist 0.56

König's theorem

Entitydist 0.62

Entitydist 0.63

Entitydist 0.66

Brun–Titchmarsh theorem

Entitydist 0.66

Artin–Rees lemma

Entitydist 0.67

Poncelet–Steiner theorem

Entitydist 0.67

generalized polygon

Entitydist 0.67

Entitydist 0.67

What links here29 pages

spectral graph theory

Proofs from THE BOOK

extremal combinatorics

Gyula O. H. Katona

double counting

Sperner's theorem

Erdős–Rado theorem

Journal of Combinatorial Theory

binomial coefficient