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

Anti-Ramsey numbers for matchings in 3-regular bipartite graphs

Author

Listed:
  • Jin, Zemin

Abstract

The anti-Ramsey number AR(Kn, H) was introduced by Erdős, Simonovits and Sós in 1973, which is defined to be the maximum number of colors in an edge coloring of the complete graph Kn without any rainbow H. Later, the anti-Ramsey numbers for several special graph classes in complete are determined. Moreover, researchers generalized the host graph Kn to other graphs, in particular, to complete bipartite graphs and regular bipartite graphs. Li and Xu (2009) [18] proved that: Let G be a k-regular bipartite graph with n vertices in each partite set, then AR(G,mK2)=k(m−2)+1 for all m ≥ 2, k ≥ 3 and n>3(m−1). In this paper, we consider the anti-Ramsey number for matchings in 3-regular bipartite graphs. By using the known result that the vertex cover equals the size of maximum matching in bipartite graphs, we prove that AR(G,mK2)=3(m−2)+1 for n>32(m−1) when G is a 3-regular bipartite graph with n vertices in each partite set.

Suggested Citation

  • Jin, Zemin, 2017. "Anti-Ramsey numbers for matchings in 3-regular bipartite graphs," Applied Mathematics and Computation, Elsevier, vol. 292(C), pages 114-119.
    • Handle: RePEc:eee:apmaco:v:292:y:2017:i:c:p:114-119
    DOI: 10.1016/j.amc.2016.07.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316304751
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.07.037?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.

    Citations

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


    Cited by:

    1. 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).
    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. 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).
    5. Jin, Zemin & Ma, Huawei & Yu, Rui, 2022. "Rainbow matchings in an edge-colored planar bipartite graph," Applied Mathematics and Computation, Elsevier, vol. 432(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:292:y:2017:i:c:p:114-119. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.