IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v34y2017i4d10.1007_s10878-017-0125-1.html
   My bibliography  Save this article

Extremal coloring for the anti-Ramsey problem of matchings in complete graphs

Author

Listed:
  • Zemin Jin

    (Zhejiang Normal University)

  • Yuefang Sun

    (Shaoxing University)

  • Sherry H. F. Yan

    (Zhejiang Normal University)

  • Yuping Zang

    (Zhejiang Normal University)

Abstract

Given a graph G, the anti-Ramsey number $$AR(K_n,G)$$ A R ( K n , G ) is defined to be the maximum number of colors in an edge-coloring of $$K_n$$ K n which does not contain any rainbow G (i.e., all the edges of G have distinct colors). The anti-Ramsey number was introduced by Erdős et al. (Infinite and finite sets, pp 657–665, 1973) and so far it has been determined for several special graph classes. Another related interesting problem posed by Erdős et al. is the uniqueness of the extremal coloring for the anti-Ramsey number. Contrary to the anti-Ramsey number, there are few results about the extremal coloring. In this paper, we show the uniqueness of such extremal coloring for the anti-Ramsey number of matchings in the complete graph.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0125-1
    DOI: 10.1007/s10878-017-0125-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0125-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-017-0125-1?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. 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)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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).
    2. Jin, Zemin & Ma, Huawei & Yu, Rui, 2022. "Rainbow matchings in an edge-colored planar bipartite graph," Applied Mathematics and Computation, Elsevier, vol. 432(C).
    3. Qin, Zhongmei & Li, Shasha & Lan, Yongxin & Yue, Jun, 2021. "Rainbow numbers for paths in planar graphs," Applied Mathematics and Computation, Elsevier, vol. 397(C).
    4. 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).

    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. 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).
    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).

    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:spr:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0125-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.