Lower bounds for some Ramsey numbers

DOI10.1016/0097-3165(74)90067-3zbMath0285.05008OpenAlexW2090911783MaRDI QIDQ5917381

H. L. Abbott, Emlyn R. Williams

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(74)90067-3

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Permutations, words, matrices (05A05) Enumerative combinatorics (05A99)

Related Items (3)

Multicolor Ramsey numbers for triple systems ⋮ Lower bounds for bi-colored quaternary Ramsey numbers ⋮ Ramsey numbers for triples

Cites Work

• N(4, 4; 3)≥13
• Partition relations for cardinal numbers
• On Robillard′s Bounds for Ramsey Numbers
• A Note on Ramsey's Theorem
• Hypergraphs and Ramseyian Theorems
• Some remarks on the theory of graphs

This page was built for publication: Lower bounds for some Ramsey numbers