Local and meank-Ramsey numbers for complete graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199703)24:3<201::AID-JGT1>3.0.CO;2-T" /><201::AID-JGT1>3.0.CO;2-T 10.1002/(SICI)1097-0118(199703)24:3<201::AID-JGT1>3.0.CO;2-TzbMath0878.05060OpenAlexW2055481908MaRDI QIDQ3122893

Richard H. Schelp

Publication date: 5 March 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199703)24:3<201::aid-jgt1>3.0.co;2-t

zbMATH Keywords

edge coloringcomplete graph\(k\)-Ramsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (7)

Relations between 2-local and 2-mean Ramsey numbers for graphs ⋮ Local Ramsey numbers for copies of cycles ⋮ Monochromatic partitions in local edge colorings ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Local Ramsey numbers for some graphs ⋮ Local and mean Ramsey numbers for trees ⋮ Local and Mean Ramsey Numbers for Some Graphs

This page was built for publication: Local and meank-Ramsey numbers for complete graphs