On 1-dependent ramsey numbers for graphs

DOI10.7151/DMGT.1088MaRDI QIDQ4264528zbMATH OpenOpenAlexFDO

Authors E. J. Cockayne, Christina M. Mynhardt

Publication date 22 September 1999

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/0974115ff1f0b1b5f714b2c22d9a185331da5822

zbMATH Keywords

1-dependent setRamsey colouringRamsey graphRamsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 4051672
• Lower bounds for lower Ramsey numbers
• Ramsey numbers for sets of small graphs
• On \((t-1)\)-colored paths in \(t\)-colored complete graphs
• scientific article; zbMATH DE number 4148134

Cited in

(6)

• Advances on defective parameters in graphs
• Some defective parameters in graphs
• Small 1-defective Ramsey numbers in perfect graphs
• Exact values of defective Ramsey numbers in graph classes
• Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs
• Sparse sets in triangle-free graphs.

This page was built for publication: On 1-dependent ramsey numbers for graphs

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