Lower bounds for bi-colored quaternary Ramsey numbers

DOI10.1016/0012-365X(90)90379-VzbMATH Open0699.05041MaRDI QIDQ912866FDOQ912866

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

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

Cited In (2)

• New lower bounds for Ramsey number \(R(p,q;4)\)
• Title not available (Why is that?)

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)