Rainbow triangles in edge-colored Kneser graphs

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1016/J.AMC.2019.124724" rel="nofollow">DOI 10.1016/J.AMC.2019.124724</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/1433.05121" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--grey" href="https://openalex.org/works/W2973163337" rel="nofollow">OpenAlex</a><a class="pub-badge pub-badge--grey" href="https://www.wikidata.org/wiki/Q127242392" rel="nofollow"><img src="https://www.wikidata.org/static/favicon/wikidata.ico" class="pub-badge-icon" alt=""/>Wikidata</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q2284337" rel="nofollow">MaRDI QID Q2284337</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q2284337" rel="nofollow">FDO</a>

Authors Fang Wang, Huaping Wang, Bihong Lv, Zemin Jin

Publication date 14 January 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2019.124724

zbMATH Keywords

Kneser graphanti-Ramsey numberrainbow triangle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Anti-Ramsey numbers for vertex-disjoint triangles
• Rainbow triangles and cliques in edge-colored graphs
• Anti-Ramsey number of triangles in complete multipartite graphs
• Rainbow triangles in edge-colored graphs
• Rainbow numbers for cycles with pendant edges

Cites work

• An anti-Ramsey theorem on cycles
• Anti-Ramsey coloring for matchings in complete bipartite graphs
• Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
• Anti-Ramsey numbers in complete split graphs
• Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees
• Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
• Bipartite anti-Ramsey numbers of cycles
• Bipartite rainbow numbers of matchings
• Complete solution for the rainbow numbers of matchings
• Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
• Improved bounds for rainbow numbers of matchings in plane triangulations
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
• On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
• Planar anti-Ramsey numbers of paths and cycles
• Rainbow generalizations of Ramsey theory: A survey
• Rainbow matchings in edge-colored complete split graphs
• Rainbow number of matchings in planar graphs
• Rainbow numbers for cycles in plane triangulations
• Rainbow numbers for cycles with pendant edges
• Rainbow numbers for matchings and complete graphs
• Rainbow numbers for matchings in plane triangulations
• The anti-Ramsey number of perfect matching
• The rainbow number of matchings in regular bipartite graphs

Cited in

(8)

• Rainbow numbers for small graphs in planar graphs
• Rainbow triangles in arc-colored tournaments
• Anti-Ramsey number of triangles in complete multipartite graphs
• Coloring \(k\)-trees with forbidden monochrome or rainbow triangles
• Anti-Ramsey number of matchings in a hypergraph
• On graphs with a large number of edge-colorings avoiding a rainbow triangle
• Geodetic convexity and Kneser graphs
• Size and degree anti-Ramsey numbers

This page was built for publication: Rainbow triangles in edge-colored Kneser graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284337)