An upper bound for the Ramsey number M(5,4)

DOI10.1016/0097-3165(71)90002-1MaRDI QIDQ2548609zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1971

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(71)90002-1

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites work

• A uniqueness theorem for edge-chromatic graphs
• Combinatorial Relations and Chromatic Graphs
• Dichromatic graphs and Ramsey numbers
• Graph-Colouring and Combinatorial Numbers
• scientific article; zbMATH DE number 3204305 (Why is no real title available?)
• scientific article; zbMATH DE number 3277541 (Why is no real title available?)
• scientific article; zbMATH DE number 3294607 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• On Sets of Acquaintances and Strangers at any Party
• Some graph theoretic results associated with Ramsey's theorem
• Upper bounds for some Ramsey numbers

Cited in

(6)

• Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
• On group partitions associated with lower bounds for symmetric Ramsey numbers
• On finite Ramsey numbers
• Subgraph counting identities and Ramsey numbers
• On some open questions for Ramsey and Folkman numbers
• A quantum-inspired mechanical method for proving of Ramsey's theorem by symbolic computation over the finite field GF(2)

This page was built for publication: An upper bound for the Ramsey number M(5,4)

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