Critical Graphs for R(Pn, Pm) and the Star-Critical Ramsey Number for Paths
The graph Ramsey number R(G,H) is the smallest integer r such that every 2-coloring of the edges of Kr contains either a red copy of G or a blue copy of H. The star-critical Ramsey number r∗(G,H) is the smallest integer k such that every 2-coloring of the edges of Kr − K1,r−1−k contains either a red...
Main Author: | Hook Jonelle |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2015-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1827 |
Similar Items
-
Generalized Ramsey numbers for paths in 2-chromatic graphs
by: R. Meenakshi, et al.
Published: (1986-01-01) -
Star-path and star-stripe bipartite Ramsey numbers in multicoloring
by: Ghaffar Raeisi
Published: (2015-09-01) -
A Note on On-Line Ramsey Numbers for Some Paths
by: Tomasz Dzido, et al.
Published: (2021-03-01) -
Ramsey Numbers and Two-colorings ofComplete Graphs
by: Armulik, Villem-Adolf
Published: (2015) -
On size multipartite Ramsey numbers for stars versus paths and cycles
by: Anie Lusiani, et al.
Published: (2017-04-01)