Generalized Ramsey numbers for graphs with three disjoint cycles versus a complete graph

MaRDI QIDQ426880zbMATH OpenFDO

Authors Shinya Fujita

Publication date 12 June 2012

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i2p14

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

independence numberRamsey numbervertex-disjoint cycles

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Structural characterization of families of graphs (05C75)

Review text

Summary: Let \(\mathcal{F},\mathcal{G}\) be families of graphs. The generalized Ramsey number \(r(\mathcal{F},\mathcal{G})\) denotes the smallest value of \(n\) for which every red-blue coloring of \(K_n\) yields a red \(F \in \mathcal{F}\) or a blue \(G \in \mathcal{G}\). Let \(\mathcal{F}(k)\) be a family of graphs with \(k\) vertex-disjoint cycles. In this paper, we deal with the case where \(\mathcal{F} = \mathcal{F}(3)\), \(\mathcal{G} = \{K_t\}\) for some fixed \(t\) with \(t \geq 2\), and prove that \(r(\mathcal{F}(3),\mathcal{G}) =2t+5\).

Recommendations

• Generalized Ramsey theory for multiple colors
• The Ramsey numbers for disjoint unions of cycles
• scientific article; zbMATH DE number 908562
• scientific article; zbMATH DE number 679641
• On three color Ramsey numbers \(R(C_4, C_4, K_{1, n})\)

Cited in

(2)

• The optimal proper connection number of a graph with given independence number
• scientific article; zbMATH DE number 2187702 (Why is no real title available?)

This page was built for publication: Generalized Ramsey numbers for graphs with three disjoint cycles versus a complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426880)