Abstract
Here we show that Ramsey numbers M(k1,..., kn) give sharp upper bounds for the independence numbers of product graphs, in terms of the independence numbers of the factors. © 1971 Pacific Journal of Mathematics.
Cite
CITATION STYLE
APA
Erdös, P., McEliece, R. J., & Taylor, H. (1971). Ramsey bounds for graph products. Pacific Journal of Mathematics, 37(1), 45–46. https://doi.org/10.2140/pjm.1971.37.45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free