Lower bounds for bi-colored quaternary Ramsey numbers

DOI10.1016/0012-365X(90)90379-VMaRDI QIDQ912866zbMATH OpenFDO

Authors Aditya Shastri

Publication date 1990

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Ramsey numbersRamsey partition

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Generalized Ramsey theory (05C55)

Cites work

• scientific article; zbMATH DE number 3711961 (Why is no real title available?)
• scientific article; zbMATH DE number 3501476 (Why is no real title available?)
• A survey of bounds for classical Ramsey numbers
• Combinatorial Relations and Chromatic Graphs
• Graph Theory and Probability. II
• Lower bounds for some Ramsey numbers
• N(4, 4; 3)≥13
• On Robillard′s Bounds for Ramsey Numbers
• Some graph theoretic results associated with Ramsey's theorem
• Some remarks on the theory of graphs
• \(N(5,4;3)\geq 24\)

Cited in

(2)

• New lower bounds for Ramsey number \(R(p,q;4)\)
• scientific article; zbMATH DE number 5850550 (Why is no real title available?)

This page was built for publication: Lower bounds for bi-colored quaternary Ramsey numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q912866)