Abstract
For any graph class \({\cal G}\) and any two positive integers i and j, the Ramsey number \(R_{\cal G}(i,j)\) is the smallest integer such that every graph in \({\cal G}\) on at least \(R_{\cal G}(i,j)\) vertices has a clique of size i or an independent set of size j. For the class of all graphs Ramsey numbers are notoriously hard to determine, and the exact values are known only for very small integers i and j. For planar graphs all Ramsey numbers can be determined by an exact formula, whereas for claw-free graphs there exist Ramsey numbers that are as difficult to determine as for arbitrary graphs. No further graph classes seem to have been studied for this purpose. Here, we give exact formulas for determining all Ramsey numbers for various classes of graphs. Our main result is an exact formula for all Ramsey numbers for line graphs, which form a large subclass of claw-free graphs and are not perfect. We obtain this by proving a general result of independent interest: an upper bound on the number of edges any graph can have if it has bounded degree and bounded matching size. As complementary results, we determine all Ramsey numbers for perfect graphs and for several subclasses of perfect graphs.
This work is supported by the Research Council of Norway.
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
Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. SIAM (1999)
Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51–229 (2006)
Chudnovsky, M., Seymour, P.: The structure of claw-free graphs. In: Surveys in Combinatorics 2005. London Math. Soc. Lecture Note Ser., p. 327 (2005)
Cockayne, E.J., Lorimer, P.J.: On Ramsey graph numbers for stars and stripes. Canad. Math. Bull. 18, 31–34 (1975)
Diestel, R.: Graph Theory, Electronic edition. Springer (2005)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Disc. Math. 57 (2004)
Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory, 2nd edn. Wiley (1990)
Harary, F.: Graph Theory. Addison-Wesley (1969)
Matthews, M.M.: Longest paths and cycles in K 1,3-free graphs. Journal of Graph Theory 9, 269–277 (1985)
Radziszowski, S.P.: Small Ramsey numbers. Electronic Journal of Combinatorics, Dynamic Surveys (2011)
Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc. Series 2, vol. 30, pp. 264–286 (1930)
Spencer, J.H.: Ten Lectures on the Probabilistic Method. SIAM (1994)
Steinberg, R., Tovey, C.A.: Planar Ramsey numbers. J. Combinatorial Theory Series B 59, 288–296 (1993)
Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz. 3, 25–30 (1964) (in Russian)
Walker, K.: The analog of Ramsey numbers for planar graphs. Bull. London Math. Soc. 1, 187–190 (1969)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Belmonte, R., Heggernes, P., van ’t Hof, P., Saei, R. (2012). Ramsey Numbers for Line Graphs and Perfect Graphs. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds) Computing and Combinatorics. COCOON 2012. Lecture Notes in Computer Science, vol 7434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32241-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-32241-9_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32240-2
Online ISBN: 978-3-642-32241-9
eBook Packages: Computer ScienceComputer Science (R0)