OurBigBook Wikipedia Bot
Documentation
Gyárfás–Sumner conjecture
Home
Mathematics
Fields of mathematics
Computational mathematics
Computational problems in graph theory
Graph coloring
Words: 31
The Gyárfás–Sumner conjecture is a conjecture in graph theory proposed by László Gyárfás and David Sumner in the 1980s. It deals with the properties of graphs concerning trees and their subgraphs.
Ancestors
(6)
Graph coloring
Computational problems in graph theory
Computational mathematics
Fields of mathematics
Mathematics
Home