Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:journalhosting.ucalgary.ca:article/62045

Some Ramsey theorems for finite n-colorable and n-chromatic graphs

Authors
Publication date
28 September 2010
Publisher
Faculty of Science, University of Calgary
Doi

    Abstract

    Given a fixed integer nn, we prove Ramsey-type theorems for the classes of all finite ordered nn-colorable graphs, finite nn-colorable graphs, finite ordered nn-chromatic graphs, and finite nn-chromatic graphs

    Similar works

    Full text

    thumbnail-image

    Contributions to Discrete Mathematics (E-Journal, University of Calgary)

    redirect
    oaioai:journalhosting.ucalgary.ca...
    Last time updated on 15/12/2019

    This paper was published in Contributions to Discrete Mathematics (E-Journal, University of Calgary).

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.