Artigo Acesso aberto Revisado por pares

New Ramsey Bounds from Cyclic Graphs of Prime Order

1997; Society for Industrial and Applied Mathematics; Volume: 10; Issue: 3 Linguagem: Inglês

10.1137/s0895480196298378

ISSN

1095-7146

Autores

Neil J. Calkin, Paul Erdős, Craig A. Tovey,

Tópico(s)

Advanced Topology and Set Theory

Resumo

We present new explicit lower bounds for some Ramsey numbers. All the graphs are cyclic and are on a prime number of vertices. We give theoretical motivation for searching for Ramsey graphs of prime order and provide additional computational evidence that primes tend to be better than composites.

Referência(s)