On restricted colourings of K_ n

DOI10.1007/BF02579162MaRDI QIDQ793052zbMATHOpenAlexFDO

Authors Vera T. Sós, Miklós Simonovits

Publication date 1984

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02579162

zbMATH Keywords

anti-Ramsey numberscolourings of subgraphs

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Recommendations

• scientific article; zbMATH DE number 3494450
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• Anti-Ramsey numbers of minimal graphs
• On a generalized anti-Ramsey problem
• Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs

Cites work

• Edge-colored complete graphs with precisely colored subgraphs
• On maximal paths and circuits of graphs

Cited in

(51)

• Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza
• New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring
• Restricted k-color partitions, II
• On the tractability of \(( k , i )\)-coloring
• On the maximal colorings of complete graphs without some small properly colored subgraphs
• Anti-Ramsey numbers of paths and cycles in hypergraphs
• An anti-Ramsey theorem of \(k\)-restricted edge-cuts
• Improved approximation for maximum edge colouring problem
• Minimal colorings for properly colored subgraphs
• Colourings of \((r,k)\)-fans
• Anti-Ramsey numbers of graphs with small connected components
• \((k,\lambda)\)-anti-powers and other patterns in words
• Rainbow number of matchings in planar graphs
• Totally Multicolored diamonds
• Bipartite rainbow numbers of matchings
• Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
• Complexity of Computing the Anti-Ramsey Numbers for Paths.
• \(k\)-colouring when \(k\) is close to \(\Delta\)
• Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
• A (5,5)-Colouring of K_n with Few Colours
• On the approximability of the minimum rainbow subgraph problem and other related problems
• On maximum face-constrained coloring of plane graphs with no short face cycles.
• Maximum number of colors: C-coloring and related problems
• The rainbow number of matchings in regular bipartite graphs
• Anti-Ramsey number of matchings in a hypergraph
• An upper bound for van der Waerden-like numbers using \(k\) colors
• Anti-Ramsey numbers for matchings in regular bipartite graphs
• On the extremal combinatorics of the Hamming space
• Rainbow numbers for certain graphs
• Anti-Ramsey problems for cycles
• Complete solution for the rainbow numbers of matchings
• An anti-Ramsey theorem on diamonds
• Maximum face-constrained coloring of plane graphs
• An anti-Ramsey theorem on cycles
• Anti-Ramsey numbers for vertex-disjoint triangles
• Rainbow generalizations of Ramsey theory: A survey
• scientific article; zbMATH DE number 653278 (Why is no real title available?)
• Anti-Ramsey numbers of subdivided graphs
• Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
• Anti-Ramsey colorings in several rounds
• On heterochromatic out-directed spanning trees in tournaments
• Rainbow numbers for matchings and complete graphs
• An anti-Ramsey theorem
• On the anti-Ramsey numbers of linear forests
• Balanced edge-colorings avoiding rainbow cliques of size four
• On the anti-Ramsey number of forests
• Better lower and upper bounds for the minimum rainbow subgraph problem
• Anti-Ramsey coloring for matchings in complete bipartite graphs
• Rainbow matchings in edge-colored complete split graphs
• On Erdős-Rado numbers
• Edge-colorings of complete graphs that avoid polychromatic trees

This page was built for publication: On restricted colourings of \(K_ n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793052)