Abstract
Given a graph G, a k-sparsej-set is a set of j vertices inducing a subgraph with maximum degree at most k. A k-densei-set is a set of i vertices that is k-sparse in the complement of G. As a generalization of Ramsey numbers, the k-defective Ramsey number RkG(i,j) for the graph class G is defined as the smallest natural number n such that all graphs on n vertices in the class G have either a k-dense i-set or a k-sparse j-set. In this paper, we examine RkG(i,j) where G represents various graph classes. For forests and cographs, we give exact formulas for all defective Ramsey numbers. For cacti, bipartite graphs and split graphs, we derive defective Ramsey numbers in most of the cases and point out open questions, formulated as conjectures if possible.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.