Rainbow matchings in edge-colored complete split graphs
From MaRDI portal
Publication:1746587
DOI10.1016/J.EJC.2018.01.010zbMATH Open1384.05088OpenAlexW2789779990WikidataQ130202935 ScholiaQ130202935MaRDI QIDQ1746587FDOQ1746587
Authors: Xianqiang Yang 
Publication date: 25 April 2018
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2018.01.010
Recommendations
- Anti-Ramsey numbers in complete split graphs
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
- Anti-Ramsey numbers in complete \(k\)-partite graphs
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- Anti-Ramsey number of triangles in complete multipartite graphs
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Matching theory
- 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
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Rainbow numbers for cycles in plane triangulations
- Title not available (Why is that?)
- Rainbow generalizations of Ramsey theory: A survey
- The anti-Ramsey number of perfect matching
- On restricted colourings of \(K_ n\)
- On degree anti-Ramsey numbers
- Complete solution for the rainbow numbers of matchings
- Anti-Ramsey number of matchings in hypergraphs
- An anti-Ramsey theorem
- Anti-Ramsey numbers of subdivided graphs
- Anti-Ramsey numbers for graphs with independent cycles
- Edge-colorings of complete bipartite graphs without large rainbow trees
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- The rainbow number of matchings in regular bipartite graphs
- Anti-Ramsey numbers for matchings in regular bipartite graphs
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
- Rainbow cliques in edge-colored graphs
Cited In (21)
- Anti-Ramsey number of matchings in outerplanar graphs
- Anti-Ramsey numbers in complete split graphs
- Rainbow disjoint union of \(P_4\) and a matching in complete graphs
- Rainbow Colouring of Split and Threshold Graphs
- Rainbow numbers for paths in planar graphs
- Anti-Ramsey problems in the Mycielskian of a cycle
- Rainbow matchings in an edge-colored planar bipartite graph
- A rainbow \(k\)-matching in the complete graph with \(r\) colors
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
- Resistance distances and the Moon-type formula of a vertex-weighted complete split graph
- Rainbow triangles in edge-colored Kneser graphs
- On splittable colorings of graphs and hypergraphs
- Rainbow number of matchings in planar graphs
- Counting spanning trees of multiple complete split-like graph containing a given spanning forest
- Existence of rainbow matchings in properly edge-colored graphs
- Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs
- Anti-Ramsey numbers for cycles in \(n\)-prisms
- Anti-Ramsey numbers for cycles in the generalized Petersen graphs
- Anti-Ramsey number of matchings in a hypergraph
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
- Avoiding rainbow 2-connected subgraphs
This page was built for publication: Rainbow matchings in edge-colored complete split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746587)
