Erdős–Gyárfás conjecture (Q3686826)

From Wikidata
Jump to navigation Jump to search
unproven conjecture that every graph with minimum degree 3 contains a simple cycle whose length is a power of two
edit
Language Label Description Also known as
English
Erdős–Gyárfás conjecture
unproven conjecture that every graph with minimum degree 3 contains a simple cycle whose length is a power of two

    Statements

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit