On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
From MaRDI portal
Publication:3904632
DOI10.1002/jgt.3190070112zbMath0456.05038OpenAlexW2090515205WikidataQ123285719 ScholiaQ123285719MaRDI QIDQ3904632
Publication date: 1983
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190070112
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (51)
Improved bounds for rainbow numbers of matchings in plane triangulations ⋮ Anti-Ramsey numbers in complete split graphs ⋮ Rainbow numbers for matchings and complete graphs ⋮ Anti-Ramsey numbers of graphs with small connected components ⋮ Anti-Ramsey number of Hanoi graphs ⋮ Improved approximation for maximum edge colouring problem ⋮ Rainbow number of matchings in planar graphs ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees ⋮ On the anti-Ramsey number of forests ⋮ Exact rainbow numbers for matchings in plane triangulations ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Planar anti-Ramsey numbers of matchings ⋮ Long rainbow paths and rainbow cycles in edge colored graphs. A survey ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs ⋮ Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs ⋮ New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring ⋮ Coloring the cube with rainbow cycles ⋮ Edge-colorings of complete graphs that avoid polychromatic trees ⋮ Maximum face-constrained coloring of plane graphs ⋮ On maximum face-constrained coloring of plane graphs with no short face cycles. ⋮ Anti-Ramsey numbers for matchings in 3-regular bipartite graphs ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs ⋮ Rainbow numbers for paths in planar graphs ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Anti-Ramsey problems for cycles ⋮ Anti-Ramsey coloring for matchings in complete bipartite graphs ⋮ Avoiding rainbow 2-connected subgraphs ⋮ Anti-Ramsey numbers for disjoint copies of graphs ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ The rainbow number of matchings in regular bipartite graphs ⋮ Anti-Ramsey number of triangles in complete multipartite graphs ⋮ Rainbow numbers for cycles with pendant edges ⋮ On the maximal colorings of complete graphs without some small properly colored subgraphs ⋮ Bipartite rainbow numbers of matchings ⋮ Complete solution for the rainbow numbers of matchings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs ⋮ Planar anti-Ramsey numbers of paths and cycles ⋮ Anti-Ramsey numbers for cycles in \(n\)-prisms ⋮ On rainbow matchings in plane triangulations ⋮ On Erdős-Rado numbers ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings ⋮ Anti-Ramsey numbers for vertex-disjoint triangles ⋮ An anti-Ramsey theorem on cycles ⋮ Anti-Ramsey numbers of subdivided graphs ⋮ Rainbow numbers for certain graphs
This page was built for publication: On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
