Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Remarks on a conjecture of Barat and Toth|
|Abstract:||In 2010, Barat and Toth verified that any r-critical graph with at most r + 4 vertices has a subdivision of K-r. Based in this result, the authors conjectured that, for every positive integer c, there exists a bound r(c) such that for any r, where r >= r(c), any r-critical graph on r + c vertices has a subdivision of K-r. In this note, we verify the validity of this conjecture for c = 5, and show counterexamples for all c >= 6.|
|Editor:||Electronic Journal Of Combinatorics|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.