On irredundant Ramsey numbers for graphs

DOI10.1002/JGT.3190140407zbMath0705.05048OpenAlexW2032666781MaRDI QIDQ3484871

Johannes H. Hattingh

Publication date: 1990

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190140407

zbMATH Keywords

irredundant setirredundant Ramsey numberirredundancyirredundant vertex

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (4)

Irredundance perfect graphs ⋮ ASYMPTOTIC BOUNDS FOR IRREDUNDANT RAMSEY NUMBERS ⋮ The irredundant ramsey number s(3,3,3) = 13 ⋮ On upper domination Ramsey numbers for graphs.

This page was built for publication: On irredundant Ramsey numbers for graphs