Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings

DOI10.1007/s00373-019-02053-yzbMath1426.05044OpenAlexW2954615188MaRDI QIDQ2334066

Yanyan Li

Publication date: 6 November 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-019-02053-y

zbMATH Keywords

complete bipartite graphHamiltonian cycleperfect matchinganti-Ramsey problem

Mathematics Subject Classification ID

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) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Rainbow matchings in an edge-colored planar bipartite graph ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ Anti-Ramsey problems for cycles ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ Anti-Ramsey number of triangles in complete multipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rainbow generalizations of Ramsey theory: A survey
• The rainbow number of matchings in regular bipartite graphs
• The anti-Ramsey number of perfect matching
• On restricted colourings of \(K_ n\)
• Bipartite rainbow numbers of matchings
• Complete solution for the rainbow numbers of matchings
• Edge-colorings of complete graphs that avoid polychromatic trees
• Anti-Ramsey numbers of subdivided graphs
• Rainbow numbers for matchings and complete graphs
• Anti-Ramsey numbers for graphs with independent cycles
• On Hamilton's ideals
• An anti-Ramsey theorem on cycles
• Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees
• 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

This page was built for publication: Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings