Construction of Special Edge-Chromatic Graphs

DOI10.4153/CMB-1965-041-7MaRDI QIDQ5341594zbMATH OpenOpenAlexFDO

Authors J. G. Kalbfleisch

Publication date 1965

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cmb-1965-041-7

zbMATH Keywords

topology

Cited in

(18)

• On the Ramsey numbers R(3,8) and R(3,9)
• Sum-free sets and Ramsey numbers
• Sum-free sets and Ramsey numbers. II
• Subgraph counting identities and Ramsey numbers
• New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14)
• A note on upper bounds for some Ramsey numbers
• Path Ramsey numbers in multicolorings
• Idiosynchromatic poetry
• New lower bounds for 28 classical Ramsey numbers
• Another analog of Ramsey numbers
• On Ramsey numbers and \(K_ r\)-coloring of graphs
• Ramsey numbers for graphs with five vertices
• R(4, 5) = 25
• A survey of bounds for classical Ramsey numbers
• Triangular Ramsey numbers
• On some open questions for Ramsey and Folkman numbers
• A formal proof of R(4,5)=25
• On the Ramsey numbers for stars versus complete graphs

This page was built for publication: Construction of Special Edge-Chromatic Graphs

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