Abstract
The cochromatic number of a graph G is the minimum number of stable sets and cliques of G covering the vertex-set of G. In this paper we survey some resent results and techniques developed in an attempt to answer the question: excluding which induced subgraphs causes a graph to have bounded cochromatic number?
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Berger, K. Choromanski, M. Chudnovsky, J. Fox, M. Loebl, A. Scott, P. Seymour and S. Thomassé, Tournaments and colouring, Journal of Combinatorial Theory, Ser. B 103 (2013), 1–20.
M. Chudnovsky, A. Scott and P. Seymour, Excluding pairs of graphs, Journal of Combinatorial Theory, Ser B, to appear.
M. Chudnovsky and P. Seymour, Extending the Gyárfás-Sumner conjecture, Journal of Combinatorial Theory, Ser B, to appear.
P. Erdős, Graph theory and probability, Canad. J. Math. 11 (1959), 34–38.
A. Gyárfás, On Ramsey covering-numbers, Coll. Math. Soc. János Bolyai, In: “Infinite and Finite Sets”, North Holland/ American Elsevier, New York, 1975, 10.
A. Gyárfás, E. Szemeredi and ZS. Tuza, Induced subtrees in graphs of large chromatic number, Discrete Mathematics 30 (1980), 235–244.
H. A. Kierstead and S. G. Penrice, Radius two trees specify—bounded classes, Journal of Graph Theory 18 (1994),119–129.
H. A. Kierstead and Y. Zhu, Radius three trees in graphs with large chromatic number, SIAM J. Discrete Math. 17 (2004), 571–581.
A. Scott, Induced trees in graphs of large chromatic number, Journal of Graph Theory 24 (1997), 297–311.
D. P. Sumner, Subtrees of a graph and chromatic number, In: “The Theory and Applications of Graphs”, G. Chartrand (ed.), John Wiley & Sons, New York (1981), 557–576.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Scuola Normale Superiore Pisa
About this paper
Cite this paper
Chudnovsky, M. (2014). Cliques and stable sets in undirected graphs. In: Matoušek, J., Nešetřil, J., Pellegrini, M. (eds) Geometry, Structure and Randomness in Combinatorics. CRM Series, vol 18. Edizioni della Normale, Pisa. https://doi.org/10.1007/978-88-7642-525-7_2
Download citation
DOI: https://doi.org/10.1007/978-88-7642-525-7_2
Publisher Name: Edizioni della Normale, Pisa
Print ISBN: 978-88-7642-524-0
Online ISBN: 978-88-7642-525-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)