Gyárfás–Sumner conjecture
id:
gy-rf-s-sumner-conjecture-284-17634070
title:
Gyárfás–Sumner conjecture
text:
In graph theory, the Gyárfás–Sumner conjecture asks whether, for every tree T and complete graph K , the graphs with neither T nor K as induced subgraphs can be properly colored using only a constant number of colors. Equivalently, it asks whether the T -free graphs are χ -bounded.
It is named after András Gyárfás and David Sumner, who formulated it independently in 1975 and 1981 respectively. It remains unproven. In this conjecture, it is not possible to replace T by a graph with cycles. As Pau
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Gy%C3%A1rf%C3%A1s%E2%80%93Sumner_conjecture
date created:
date modified:
2024-01-11T23:08:25Z
main entity:
{"identifier":"Q48999679","url":"https://www.wikidata.org/entity/Q48999679"}
image:
fields total:
13
integrity:
13