András Gyárfás
András Gyárfás is a Hungarian mathematician who specializes in the study of graph theory. He is famous for two conjectures:
- Together with Paul Erdős he conjectured what is now called the Erdős–Gyárfás conjecture which states that any graph with minimum degree 3 contains a cycle whose length is a power of two.
- He and David Sumner independently formulated the Gyárfás–Sumner conjecture according to which, for every tree T, the T-free graphs are χ-bounded.