Abstract
For a graph theoretic parameter f, an integer m and a graph H, the mixed Ramsey number v(f; m; H) is defined as the least positive integer p such that if G is any graph of order p, then either f(G)⩾m or Ḡ contains a subgraph isomorphic to H. Let ϱ denote vertex linear arboricity and let H be any connected graph of order n. In this note we show that v(ϱ; m; H) = 1 + (n + np(H) − 2)(m − 1), where np(H) is the path partition number of H.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
