Anti-Ramsey numbers for matchings in regular bipartite graphs
DOI10.1142/S1793830917500197zbMATH Open1362.05048OpenAlexW2587496325MaRDI QIDQ5347253FDOQ5347253
Oothan Nweit, Zemin Jin, Kaijun Wang, Yuling Wang
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
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
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)
Cites Work
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Bipartite rainbow numbers of matchings
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- 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
- Title not available (Why is that?)
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Title not available (Why is that?)
- Rainbow generalizations of Ramsey theory: A survey
- On restricted colourings of \(K_ n\)
- Complete solution for the rainbow numbers of matchings
- An anti-Ramsey theorem
- Anti-Ramsey numbers of subdivided graphs
- Anti-Ramsey numbers for graphs with independent cycles
- Title not available (Why is that?)
- The rainbow number of matchings in regular bipartite graphs
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
- Rainbow cliques in edge-colored graphs
Cited In (8)
- Anti-Ramsey numbers of doubly edge-critical graphs
- Title not available (Why is that?)
- 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
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)
