scientific article
From MaRDI portal
Publication:4075490
zbMath0316.05111MaRDI QIDQ4075490
Vera T. Sós, Miklós Simmonovits, Paul Erdős
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (95)
Improved bounds for rainbow numbers of matchings in plane triangulations ⋮ Anti-Ramsey numbers in complete split graphs ⋮ Rainbow numbers for matchings and complete graphs ⋮ Path and cycle sub-Ramsey numbers and an edge-colouring conjecture ⋮ \((k,\lambda)\)-anti-powers and other patterns in words ⋮ Anti-Ramsey number of Hanoi graphs ⋮ Anti-Ramsey numbers for cycles in the generalized Petersen graphs ⋮ Anti-Ramsey Hypergraph Numbers ⋮ Anti-van der Waerden numbers on graphs ⋮ An anti-Ramsey theorem of \(k\)-restricted edge-cuts ⋮ Improved approximation for maximum edge colouring problem ⋮ Rainbow matchings in an edge-colored planar bipartite graph ⋮ Approximation and hardness results for the maximum edge \(q\)-coloring problem ⋮ Some heterochromatic theorems for matroids ⋮ 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 ⋮ On odd rainbow cycles in edge-colored graphs ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Facial rainbow edge-coloring of plane graphs ⋮ Complete edge-colored permutation graphs ⋮ Anti-Ramsey number of matchings in hypergraphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Rainbow numbers for matchings in plane triangulations ⋮ Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Anti-Ramsey problems in the Mycielskian of a cycle ⋮ Constrained Ramsey numbers for the loose path, cycle and star ⋮ Exactly \(m\)-coloured complete infinite subgraphs ⋮ Rainbow subgraphs in edge-colored planar and outerplanar graphs ⋮ The Erdős–Gyárfás function with respect to Gallai‐colorings ⋮ Totally Multicolored diamonds ⋮ On sufficient conditions for rainbow cycles in edge-colored graphs ⋮ Planar anti-Ramsey numbers of matchings ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs ⋮ Computing the anti-Ramsey number for trees in complete tripartite graph ⋮ Size and degree anti-Ramsey numbers ⋮ On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems ⋮ 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 ⋮ More star sub-Ramsey numbers ⋮ Anti-Ramsey number of disjoint union of star-like hypergraphs ⋮ New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring ⋮ Coloring the cube with rainbow cycles ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees ⋮ On a heterochromatic number for hypercubes ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ Unnamed Item ⋮ Edge-colorings avoiding rainbow and monochromatic subgraphs ⋮ The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs ⋮ A large number of \(m\)-coloured complete infinite subgraphs ⋮ Rainbow numbers for paths in planar graphs ⋮ Anti-Ramsey problems for cycles ⋮ Anti-powers in infinite words ⋮ Anti-Ramsey coloring for matchings in complete bipartite graphs ⋮ Monochromatic subgraphs in the absence of a properly colored 4-cycle ⋮ Anti-Ramsey properties of random graphs ⋮ Not complementary connected and not CIS \(d\)-graphs form weakly monotone families ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ Properly colored \(C_4\)'s in edge-colored graphs ⋮ On the anti-Ramsey numbers of linear forests ⋮ Anti-Ramsey numbers in complete \(k\)-partite graphs ⋮ Rainbow triangles and cliques in edge-colored graphs ⋮ Rainbow connection and graph products ⋮ Constructive Methods in Gallai-Ramsey Theory for Hypergraphs ⋮ A note on the monotonicity of mixed Ramsey numbers ⋮ Anti-Ramsey numbers for disjoint copies of graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ Rainbow cliques in edge-colored graphs ⋮ On the balanced upper chromatic number of cyclic projective planes and projective spaces ⋮ The rainbow number of matchings in regular bipartite graphs ⋮ Anti-Ramsey number of triangles in complete multipartite graphs ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ On the maximal colorings of complete graphs without some small properly colored subgraphs ⋮ Transversals in generalized Latin squares ⋮ Complexity of Computing the Anti-Ramsey Numbers for Paths. ⋮ Bipartite rainbow numbers of matchings ⋮ Complete solution for the rainbow numbers of matchings ⋮ The anti-Ramsey number of perfect matching ⋮ Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs ⋮ 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 ⋮ Rainbow-free 3-colorings in abelian groups ⋮ Complete graphs without polychromatic circuits ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings ⋮ Anti-Ramsey numbers for vertex-disjoint triangles ⋮ Anti-Ramsey colorings in several rounds ⋮ Anti-Ramsey numbers of subdivided graphs ⋮ Rainbow numbers for certain graphs ⋮ $(g,f)$-Chromatic spanning trees and forests ⋮ Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs ⋮ Mono-multi bipartite Ramsey numbers, designs, and matrices
This page was built for publication:
