Erdős–Faber–Lovász conjecture (Q5385322)

From Wikidata
Jump to: navigation, search
a conjecture about coloring graphs formed by combining complete graphs
    No aliases defined
edit
Language Label Description Also known as
English
Erdős–Faber–Lovász conjecture
a conjecture about coloring graphs formed by combining complete graphs

    Statements

    0 references
    0 references
    0 references
    0 references
    edit
      edit
        edit
          edit
            edit
              edit