Turán's theorem (Q1047749)

From Wikidata
Jump to: navigation, search
theorem bounding the number of edges in a graph that has no large cliques
edit
Language Label Description Also known as
English
Turán's theorem
theorem bounding the number of edges in a graph that has no large cliques

    Statements

    0 references

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit