On restricted colourings of \(K_ n\)
From MaRDI portal
Publication:793052
DOI10.1007/BF02579162zbMath0538.05047OpenAlexW1973304312MaRDI QIDQ793052
Vera T. Sós, Miklós Simmonovits
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579162
Related Items (44)
Rainbow numbers for matchings and complete graphs ⋮ Anti-Ramsey numbers of graphs with small connected components ⋮ \((k,\lambda)\)-anti-powers and other patterns in words ⋮ On the extremal combinatorics of the Hamming space ⋮ An anti-Ramsey theorem of \(k\)-restricted edge-cuts ⋮ Improved approximation for maximum edge colouring problem ⋮ Rainbow number of matchings in planar graphs ⋮ On the anti-Ramsey number of forests ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ An anti-Ramsey theorem on diamonds ⋮ On the approximability of the minimum rainbow subgraph problem and other related problems ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Totally Multicolored diamonds ⋮ Maximum number of colors: C-coloring and related problems ⋮ Balanced edge-colorings avoiding rainbow cliques of size four ⋮ New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring ⋮ Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza ⋮ 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 ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Anti-Ramsey problems for cycles ⋮ Anti-Ramsey coloring for matchings in complete bipartite graphs ⋮ Better lower and upper bounds for the minimum rainbow subgraph problem ⋮ An anti-Ramsey theorem ⋮ On the anti-Ramsey numbers of linear forests ⋮ On heterochromatic out-directed spanning trees in tournaments ⋮ The rainbow number of matchings in regular bipartite graphs ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ On the maximal colorings of complete graphs without some small properly colored subgraphs ⋮ Complexity of Computing the Anti-Ramsey Numbers for Paths. ⋮ Bipartite rainbow numbers of matchings ⋮ Complete solution for the rainbow numbers of matchings ⋮ Minimal colorings for properly colored subgraphs ⋮ 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 colorings in several rounds ⋮ Anti-Ramsey numbers of subdivided graphs ⋮ Rainbow numbers for certain graphs
Cites Work
This page was built for publication: On restricted colourings of \(K_ n\)
