Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Search

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

Turán's theorem · Vinony

🌐English

English Deutsch Español Français Polski Português Türkçe Русский 中文日本語

EntityQ1047749· pop 11· linked from 34 articles

Turán's theorem

theorem bounding the number of edges in a graph that has no large cliques

Connections

International Standard Book Number

Categories

Extremal graph theory Theorems in graph theory

Sources

wikipedia.externallinksexternallink

digital object identifier

Entity

The Independent

equivalence relation

Cauchy–Schwarz inequality

equivalence class

independent set

Mathematical Reviews

Sign in to save

What links here34 pages

complete bipartite graph

glossary of graph theory terms

claw-free graph

Proofs from THE BOOK

friendship graph

extremal graph theory

Erdős–Stone theorem

pancyclic graph

triangle-free graph

Similar entities

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

Entitydist 0.39

König's theorem

Entitydist 0.49

Erdős–Faber–Lovász conjecture

Entitydist 0.53

bipartite dimension

Entitydist 0.54

graph factorization

Entitydist 0.55

Erdős–Ko–Rado theorem

Entitydist 0.56

Entitydist 0.58

Entitydist 0.58

Entitydist 0.58

Entitydist 0.60

Kawasaki's theorem

Entitydist 0.60

Hadwiger conjecture

Entitydist 0.62