Induced Cycles and Chromatic Number
Copyright policy )Induced Cycles and Chromatic Number
The author proves that for any pair of positive integers \(r\) and \(s\), there exists an integer \(N(r,s)\) such that every graph with chromatic number at least \(N(r,s)\) contains either the complete graph \(K_r\) or an induced odd cycle of length at least 5 or an induced cycle of length at least \(s\). This result is a weakened version of two conjectures made by A. Gyárfás (1985) which are related to the well-known strong perfect graph conjecture as well as the Gyárfás-Sumner conjecture (1973 and 1981). Several similar/related problems had been studied before by A. Gyárfás, H. A. Kierstead, S. G. Penrice, D. P. Sumner, E. Szemeredi, W. T. Trotter and Zs. Tuza.
- University College London United Kingdom
Coloring of graphs and hypergraphs, induced cycle, Computational Theory and Mathematics, chromatic number, Discrete Mathematics and Combinatorics, Paths and cycles, Theoretical Computer Science
Coloring of graphs and hypergraphs, induced cycle, Computational Theory and Mathematics, chromatic number, Discrete Mathematics and Combinatorics, Paths and cycles, Theoretical Computer Science
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).7 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!