Jump to content

Talk:Pancake graph

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Chromatic number of the pancake graph

[edit]

The upper bounds mentioned in the article are only decent for very small values of .

A much better upper bound is the Catlin bound for -free graphs of roughly (which is also mentioned in Elena's paper, but apparently did not make it to the WIKI).

Since is subadditive (https://math.stackexchange.com/questions/3057032/chromatic-number-of-the-pancake-graph-is-subadditive) and an even better upper bound is given by .

(Note: I do not intend to make an effort to publish the stackexchange result, otherwise I would have modified the main page, but that is probably not allowed with "unofficial" results)

--Leen Droogendijk (talk) 09:36, 3 January 2019 (UTC)[reply]