Rainbow triangles in edge-colored Kneser graphs
DOI10.1016/J.AMC.2019.124724zbMATH Open1433.05121OpenAlexW2973163337WikidataQ127242392 ScholiaQ127242392MaRDI QIDQ2284337FDOQ2284337
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
Recommendations
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)
Cites Work
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Rainbow numbers for cycles with pendant edges
- Bipartite rainbow numbers of matchings
- Rainbow numbers for matchings and complete graphs
- An anti-Ramsey theorem on cycles
- Anti-Ramsey numbers in complete split graphs
- Bipartite anti-Ramsey numbers of cycles
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- Rainbow numbers for matchings in plane triangulations
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Rainbow Numbers for Cycles in Plane Triangulations
- Rainbow generalizations of Ramsey theory: A survey
- The anti-Ramsey number of perfect matching
- Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees
- Complete solution for the rainbow numbers of matchings
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- The rainbow number of matchings in regular bipartite graphs
- Rainbow number of matchings in planar graphs
- Planar anti-Ramsey numbers of paths and cycles
- Rainbow matchings in edge-colored complete split graphs
- Improved bounds for rainbow numbers of matchings in plane triangulations
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
Cited In (7)
- Rainbow numbers for small graphs in planar graphs
- Geodetic convexity and Kneser 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
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)
