Skip to main content
SpringerLink
Log in

Cliques and stable sets in undirected graphs

  • Conference paper
Book cover Geometry, Structure and Randomness in Combinatorics

Part of the book series: CRM Series ((CRMSNS,volume 18))

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?

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 24.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 34.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Article  MATH  Google Scholar 

  2. M. Chudnovsky, A. Scott and P. Seymour, Excluding pairs of graphs, Journal of Combinatorial Theory, Ser B, to appear.

    Google Scholar 

  3. M. Chudnovsky and P. Seymour, Extending the Gyárfás-Sumner conjecture, Journal of Combinatorial Theory, Ser B, to appear.

    Google Scholar 

  4. P. Erdős, Graph theory and probability, Canad. J. Math. 11 (1959), 34–38.

    Article  MathSciNet  Google Scholar 

  5. 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.

    Google Scholar 

  6. A. Gyárfás, E. Szemeredi and ZS. Tuza, Induced subtrees in graphs of large chromatic number, Discrete Mathematics 30 (1980), 235–244.

    Article  MATH  MathSciNet  Google Scholar 

  7. H. A. Kierstead and S. G. Penrice, Radius two trees specify—bounded classes, Journal of Graph Theory 18 (1994),119–129.

    Article  MATH  MathSciNet  Google Scholar 

  8. H. A. Kierstead and Y. Zhu, Radius three trees in graphs with large chromatic number, SIAM J. Discrete Math. 17 (2004), 571–581.

    Article  MATH  MathSciNet  Google Scholar 

  9. A. Scott, Induced trees in graphs of large chromatic number, Journal of Graph Theory 24 (1997), 297–311.

    Article  MATH  MathSciNet  Google Scholar 

  10. 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.

    Google Scholar 

Download references

Authors
  1. Maria Chudnovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Applied Mathematics, Charles University, Malostranské nám. 25, 118 00, Praha 1, Czech Republic

    Jiří Matoušek

  2. Institute of Theoretical Computer Science, ETH Zürich, 8092, Zürich, Switzerland

    Jiří Matoušek

  3. Department of Applied Mathematics, Charles University and Institute for Theoretical Computer Science (ITI), Malostranské nám. 25, 11800, Praha 1, Czech Republic

    Jaroslav Nešetřil

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation