IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v474y2024ics0096300324001516.html
   My bibliography  Save this article

Rainbow disjoint union of P4 and a matching in complete graphs

Author

Listed:
  • Jin, Zemin
  • Jie, Qing
  • Cao, Zhenxin

Abstract

An edge-colored graph G is called rainbow if all the colors on its edges are distinct. Given graphs G and H, the anti-Ramsey number AR(G,H) is the maximum number k such that there exists an edge-coloring of G with exactly k colors containing no rainbow copy of H. Recently, the anti-Ramsey problem for disjoint union of graphs received much attention. In particular, several researchers focused on the problem for graphs consisting of small components. In this paper, we continue the work in this line. We refine the bound of n and determine the precise value of AR(Kn,P4∪tP2) for all n≥2t+4 in complete graphs.

Suggested Citation

  • Jin, Zemin & Jie, Qing & Cao, Zhenxin, 2024. "Rainbow disjoint union of P4 and a matching in complete graphs," Applied Mathematics and Computation, Elsevier, vol. 474(C).
    • Handle: RePEc:eee:apmaco:v:474:y:2024:i:c:s0096300324001516
    DOI: 10.1016/j.amc.2024.128679
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324001516
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.128679?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Zemin Jin & Yuping Zang, 2017. "Anti-Ramsey coloring for matchings in complete bipartite graphs," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 1-12, January.
    2. Zemin Jin & Yuefang Sun & Sherry H. F. Yan & Yuping Zang, 2017. "Extremal coloring for the anti-Ramsey problem of matchings in complete graphs," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1012-1028, November.
    3. Jin, Zemin, 2017. "Anti-Ramsey numbers for matchings in 3-regular bipartite graphs," Applied Mathematics and Computation, Elsevier, vol. 292(C), pages 114-119.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jin, Zemin & Ma, Huawei & Yu, Rui, 2022. "Rainbow matchings in an edge-colored planar bipartite graph," Applied Mathematics and Computation, Elsevier, vol. 432(C).
    2. Liu, Huiqing & Lu, Mei & Zhang, Shunzhe, 2022. "Anti-Ramsey numbers for cycles in the generalized Petersen graphs," Applied Mathematics and Computation, Elsevier, vol. 430(C).
    3. Zemin Jin & Yuefang Sun & Sherry H. F. Yan & Yuping Zang, 2017. "Extremal coloring for the anti-Ramsey problem of matchings in complete graphs," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1012-1028, November.
    4. Pei, Yifan & Lan, Yongxin & He, Hua, 2022. "Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs," Applied Mathematics and Computation, Elsevier, vol. 418(C).
    5. Qin, Zhongmei & Li, Shasha & Lan, Yongxin & Yue, Jun, 2021. "Rainbow numbers for paths in planar graphs," Applied Mathematics and Computation, Elsevier, vol. 397(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:474:y:2024:i:c:s0096300324001516. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.