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:digitalcommons.memphis.edu:facpubs-6556

Ramsey goodness and beyond

Authors
Publication date
1 March 2009
Publisher
University of Memphis Digital Commons
Doi

    Abstract

    In a seminal paper from 1983, Burr and Erdos started the systematic study of Ramsey numbers of cliques vs. large sparse graphs, raising a number of problems. In this paper we develop a new approach to such Ramsey problems using a mix of the Szemerédi regularity lemma, embedding of sparse graphs, Turán type stability, and other structural results. We give exact Ramsey numbers for various classes of graphs, solving five - all but one - of the Burr-Erdos problems. © 2009 János Bolyai Mathematical Society and Springer Verlag

    Similar works

    Full text

    thumbnail-image

    University of Memphis Digital Commons

    redirect
    oaioai:digitalcommons.memphis.edu...
    Last time updated on 05/05/2022

    This paper was published in University of Memphis Digital Commons.

    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.