Turán's theorem

theorem bounding the number of edges in a graph that has no large cliques
rdfs:label
"Turán's theorem"@en
skos:altLabel
"Satz von Turan"@de
"Turan-Graph"@de
schema:description
"theorem bounding the number of edges in a graph that has no large cliques"@en
schema:dateModified "2026-07-10T14:24:02+00:00"^^xsd:dateTime
schema:version 2515891992
wikibase:identifiers 4
wikibase:sitelinks 11
wikibase:statements 10
p:P10565 wd:statement/Q1047749-4E24D53A-443B-4D7A-B6C8-CC9305A5E99A
p:P138 wd:statement/Q1047749-0b69be33-428c-91a7-0dce-c97b335ddc86
p:P14541 wd:statement/Q1047749-8503FAD3-9284-4F44-A437-79EDD6FD42F2
p:P2579 wd:statement/Q1047749-42c41715-4633-5172-93f2-3be78e31cd24
wd:statement/Q1047749-a0814a54-4f50-e153-2383-25e6d9e72d43
p:P31 wd:statement/Q1047749-6D81833E-2B89-4D31-9CAB-F7A371C17372
p:P361 wd:statement/Q1047749-4B72F6AD-B8D6-4602-A25A-FF9BD4E8BE5C
p:P6104 wd:statement/Q1047749-C581FB8D-E404-4FB8-906B-DC614B59F1D1
p:P6366 wd:statement/Q1047749-9AC9341E-2EDC-4E18-86F8-4BE97A801197
p:P646 wd:statement/Q1047749-77C7E377-57FD-4C08-9C08-FA227115D8F2
p:direct-normalized/P6366 <https://makg.org/entity/5262016>
wdt:P10565 "143487"
wdt:P138 Pál Turán
wdt:P14541 "16EtYe"
wdt:P2579 graph theory
extremal graph theory
wdt:P31 theorem
wdt:P361 list of theorems
wdt:P6104 WikiProject Mathematics
wdt:P6366 "5262016"
wdt:P646 "/m/01_dgg"
Download as:
TurtleJSON-LDRDF/XML
data from SPARQL profile: Wikidata