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

Rainbow triangles in edge-colored Kneser graphs

Author

Listed:
  • Jin, Zemin
  • Wang, Fang
  • Wang, Huaping
  • Lv, Bihong

Abstract

An edge-colored graph is called rainbow if all the edges have the different colors. The anti-Ramsey number AR(G, H) of a graph H in the graph G is defined to be the maximum number of colors in an edge-coloring of G which does not contain any rainbow H. In this paper, the existence of rainbow triangles in edge-colored Kneser graphs is studied. We give bounds for the anti-Ramsey number of triangles in Kneser graphs. Also, the anti-Ramsey number of triangles with an pendant edge is studied and the bounds are equal to bounds for triangles.

Suggested Citation

  • Jin, Zemin & Wang, Fang & Wang, Huaping & Lv, Bihong, 2020. "Rainbow triangles in edge-colored Kneser graphs," Applied Mathematics and Computation, Elsevier, vol. 365(C).
    • Handle: RePEc:eee:apmaco:v:365:y:2020:i:c:s0096300319307167
    DOI: 10.1016/j.amc.2019.124724
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319307167
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.124724?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. Qin, Zhongmei & Lei, Hui & Li, Shasha, 2020. "Rainbow numbers for small graphs in planar graphs," Applied Mathematics and Computation, Elsevier, vol. 371(C).
    2. Bedo, Marcos & Leite, João V.S. & Oliveira, Rodolfo A. & Protti, Fábio, 2023. "Geodetic convexity and kneser graphs," Applied Mathematics and Computation, Elsevier, vol. 449(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:365:y:2020:i:c:s0096300319307167. 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.