Local and meank-Ramsey numbers for complete graphs

DOI10.1002/(SICI)1097-0118(199703)24:3%3C201::AID-JGT1%3E3.0.CO;2-TzbMATH Open0878.05060OpenAlexW2055481908MaRDI QIDQ3122893FDOQ3122893

Authors: R. H. Schelp 

Publication date: 5 March 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199703)24:3%3C201::aid-jgt1%3E3.0.co;2-t

Recommendations

• Ramsey numbers for local colorings
• ON k-LOCAL AND k-MEAN COLORINGS OF GRAPHS AND HYPERGRAPHS
• Linear upper bounds for local Ramsey numbers
• Local \(k\)-colorings of graphs and hypergraphs

zbMATH Keywords

edge coloringcomplete graph\(k\)-Ramsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Cited In (15)

• Local and mean Ramsey numbers for trees
• On several variations of the turan and ramsey numbers
• Locally Ramsey properties of graphs
• Local Anti-Ramsey Numbers of Graphs
• Local Ramsey numbers for copies of cycles
• Three edge-coloring conjectures
• Relations between 2-local and 2-mean Ramsey numbers for graphs
• Local Ramsey numbers for copies of cycles
• Local Ramsey numbers for some graphs
• Ramsey numbers for local colorings
• Local colourings and monochromatic partitions in complete bipartite graphs
• Local and Mean Ramsey Numbers for Some Graphs
• Monochromatic partitions in local edge colorings
• Mean Ramsey–Turán numbers
• ON k-LOCAL AND k-MEAN COLORINGS OF GRAPHS AND HYPERGRAPHS

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

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