Small Ramsey Numbers | Zendy

Stanisław Radziszowski | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Small Ramsey Numbers

Author(s) -

Stanisław Radziszowski

Publication year - 2011

Publication title -

the electronic journal of combinatorics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.703

H-Index - 52

eISSN - 1097-1440

pISSN - 1077-8926

DOI - 10.37236/21

Subject(s) - ramsey's theorem , mathematics , hypergraph , combinatorics , graph , discrete mathematics , enhanced data rates for gsm evolution , ramsey theory , computer science , telecommunications

We present data which, to the best of our knowledge, includes all known nontrivial values and bounds for specific graph, hypergraph and multicolor Ramsey numbers, where the avoided graphs are complete or complete without one edge. Many results pertaining to other more studied cases are also presented. We give references to all cited bounds and values, as well as to previous similar compilations. We do not attempt complete coverage of asymptotic behavior of Ramsey numbers, but concentrate on their specific values.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research