Q1047749

From Wikidata
Jump to: navigation, search

Turán's theorem (Q1047749) [edit]

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

No aliases defined.
    [add]

    Statements

    /m/01_dgg
    [edit]
    1 reference
    [add]
    [edit]
    0 references
    [add]
    Language Code Linked page
    Deutsch dewiki
    English enwiki
    français frwiki
    עברית hewiki
    magyar huwiki
    polski plwiki
    русский ruwiki
    українська ukwiki
    中文 zhwiki
    [add]
    [add]
    [add]
    [add]
    [add]
    [add]