Skip to main content
Book Chapter

Ramsey Numbers for Sets of Five Vertex Graphs With Fixed Number of Edges

  • Harborth H
Springer Netherlands, (1993), 169-174
DOI: 10.1007/978-94-011-2080-7_11
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Harborth, H. (1993). Ramsey Numbers for Sets of Five Vertex Graphs With Fixed Number of Edges. In Finite and Infinite Combinatorics in Sets and Logic (pp. 169–174). Springer Netherlands. https://doi.org/10.1007/978-94-011-2080-7_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free