Anti-Ramsey numbers for matchings in regular bipartite graphs
From MaRDI portal
Publication:5347253
DOI10.1142/S1793830917500197zbMath1362.05048OpenAlexW2587496325MaRDI QIDQ5347253
Oothan Nweit, Kaijun Wang, Yuling Wang, Ze-min Jin
Publication date: 23 May 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830917500197
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (4)
Rainbow number of matchings in planar graphs ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Anti-Ramsey numbers in complete split graphs
- Rainbow numbers for matchings in plane triangulations
- Rainbow generalizations of Ramsey theory: A survey
- The rainbow number of matchings in regular bipartite graphs
- On restricted colourings of \(K_ n\)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Bipartite rainbow numbers of matchings
- Complete solution for the rainbow numbers of matchings
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
- Anti-Ramsey numbers of subdivided graphs
- Rainbow numbers for matchings and complete graphs
- Anti-Ramsey numbers for graphs with independent cycles
- An anti-Ramsey theorem on cycles
- Bipartite anti-Ramsey numbers of cycles
- 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
- An anti-Ramsey theorem
- Rainbow cliques in edge-colored graphs
This page was built for publication: Anti-Ramsey numbers for matchings in regular bipartite graphs
