English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Let H be a graph with the chromatic number χ(H) and the chromatic surplus s(H). A connected graph G of order n is called good with respect to H, H-good, if R(G,H) = (n − 1)(χ(H) − 1) + s(H). The notation tKm represents a graph with t identical copies of complete graphs on m vertices, Km. In this note, we discuss the goodness of path Pn with respect to tKm. It is obtained that the path Pn is tKm-good for m, t ≥ 2 and sufficiently large n. Furthermore, it is also obtained the Ramsey number R(G, tKm), where G is a disjoint union of paths.

THE GOODNESS OF LONG PATH WITH RESPECT TO MULTIPLE COPIES OF COMPLETE GRAPHS