Graph-Colouring and Combinatorial Numbers

DOI10.4153/CJM-1968-054-XMaRDI QIDQ5540281zbMATH OpenFDO

Authors Andrew Sobcyk

Publication date 1968

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1968-054-X

zbMATH Keywords

topology

Cited in

(1)

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

This page was built for publication: Graph-Colouring and Combinatorial Numbers

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