Generalized ramsey theory for graphs, I. Diagonal numbers
dc.contributor.author | Chvátal, V. | en_US |
dc.contributor.author | Harary, Frank | en_US |
dc.date.accessioned | 2006-09-08T21:09:51Z | |
dc.date.available | 2006-09-08T21:09:51Z | |
dc.date.issued | 1973-03 | en_US |
dc.identifier.citation | Chvátal, V.; Harary, F.; (1973). "Generalized ramsey theory for graphs, I. Diagonal numbers." Periodica Mathematica Hungarica 3 (1-2): 115-124. <http://hdl.handle.net/2027.42/43187> | en_US |
dc.identifier.issn | 0031-5303 | en_US |
dc.identifier.issn | 1588-2829 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/43187 | |
dc.format.extent | 443266 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers; Akadémiai Kiadó ; Springer Science+Business Media | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Mathematics, General | en_US |
dc.title | Generalized ramsey theory for graphs, I. Diagonal numbers | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, 48104, Ann Arbor, Michigan, U.S.A. | en_US |
dc.contributor.affiliationother | Department of Computer Science, Stanford University, 94305, Stanford, California, U.S.A. | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/43187/1/10998_2005_Article_BF02018466.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF02018466 | en_US |
dc.identifier.source | Periodica Mathematica Hungarica | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.