Anti-Ramsey numbers for matchings in regular bipartite graphs

DOI10.1142/S1793830917500197MaRDI QIDQ5347253zbMATH OpenOpenAlexFDO

Authors Oothan Nweit, Kaijun Wang, Yuling Wang, Zemin 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

zbMATH Keywords

matchinganti-Ramsey numberrainbow graph

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) Ramsey theory (05D10)

Recommendations

• Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
• Anti-Ramsey number of matchings in hypergraphs
• Anti-Ramsey number of matchings in a hypergraph
• Anti-Ramsey coloring for matchings in complete bipartite graphs
• Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs
• Anti-Ramsey numbers in complete k-partite graphs
• Bipartite anti-Ramsey numbers of cycles
• scientific article; zbMATH DE number 2192164
• Anti-Ramsey theory on complete bipartite graphs
• The anti-Ramsey number of perfect matching

Cites work

• scientific article; zbMATH DE number 3494450 (Why is no real title available?)
• scientific article; zbMATH DE number 2192164 (Why is no real title available?)
• An anti-Ramsey theorem
• An anti-Ramsey theorem on cycles
• Anti-Ramsey numbers for graphs with independent cycles
• Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
• Anti-Ramsey numbers in complete split graphs
• Anti-Ramsey numbers of subdivided graphs
• Bipartite anti-Ramsey numbers of cycles
• Bipartite rainbow numbers of matchings
• Complete solution for the rainbow numbers of matchings
• Edge-colorings of complete bipartite graphs without large rainbow trees
• Edge-colorings of complete graphs that avoid polychromatic trees
• Edge-colorings with no large polychromatic stars
• 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 restricted colourings of \(K_ n\)
• On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
• Rainbow cliques in edge-colored graphs
• Rainbow generalizations of Ramsey theory: A survey
• Rainbow numbers for matchings and complete graphs
• Rainbow numbers for matchings in plane triangulations
• The rainbow number of matchings in regular bipartite graphs

Cited in

(15)

• Anti-Ramsey numbers of doubly edge-critical graphs
• Anti-Ramsey number of matchings in outerplanar graphs
• Edge-colorings of complete bipartite graphs without large rainbow trees
• scientific article; zbMATH DE number 2192164 (Why is no real title available?)
• Anti-Ramsey numbers in complete k-partite graphs
• Note on the anti-Ramsey number for matching in hypercubes
• Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
• The anti-Ramsey number of perfect matching
• Antifactors of regular bipartite graphs
• Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
• Rainbow number of matchings in planar graphs
• Rainbow matchings in edge-colored complete split graphs
• Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs
• Anti-Ramsey coloring for matchings in complete bipartite graphs
• Anti-Ramsey number for perfect matchings in 3-regular bipartite graphs

This page was built for publication: Anti-Ramsey numbers for matchings in regular bipartite graphs

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