On restricted colourings of K_ n
From MaRDI portal
Publication:793052
DOI10.1007/BF02579162zbMATH Open0538.05047OpenAlexW1973304312MaRDI QIDQ793052FDOQ793052
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
Recommendations
Cites Work
Cited In (51)
- 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
- Complexity of Computing the Anti-Ramsey Numbers for Paths.
- On the approximability of the minimum rainbow subgraph problem and other related problems
- Rainbow numbers for certain graphs
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- On the anti-Ramsey number of forests
- Complete solution for the rainbow numbers of matchings
- Anti-Ramsey numbers of subdivided graphs
- Better lower and upper bounds for the minimum rainbow subgraph problem
- Minimal colorings for properly colored subgraphs
- On the extremal combinatorics of the Hamming space
- Restricted k-color partitions, II
- On the tractability of \(( k , i )\)-coloring
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
- \((k,\lambda)\)-anti-powers and other patterns in words
- Rainbow generalizations of Ramsey theory: A survey
- Anti-Ramsey numbers of graphs with small connected components
- A (5,5)-Colouring of Kn with Few Colours
- Colourings of \((r,k)\)-fans
- Totally Multicolored diamonds
- Bipartite rainbow numbers of matchings
- On maximum face-constrained coloring of plane graphs with no short face cycles.
- Maximum number of colors: C-coloring and related problems
- Anti-Ramsey problems for cycles
- An anti-Ramsey theorem on diamonds
- Edge-colorings of complete graphs that avoid polychromatic trees
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
- Anti-Ramsey numbers for matchings in regular bipartite graphs
- Anti-Ramsey numbers for vertex-disjoint triangles
- Rainbow numbers for matchings and complete graphs
- An anti-Ramsey theorem of \(k\)-restricted edge-cuts
- Improved approximation for maximum edge colouring problem
- \(k\)-colouring when \(k\) is close to \(\Delta\)
- An upper bound for van der Waerden-like numbers using \(k\) colors
- Maximum face-constrained coloring of plane graphs
- On heterochromatic out-directed spanning trees in tournaments
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
- Title not available (Why is that?)
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
- On Erdős-Rado numbers
- Rainbow number of matchings in planar graphs
- An anti-Ramsey theorem
- Anti-Ramsey colorings in several rounds
- Rainbow matchings in edge-colored complete split graphs
- An anti-Ramsey theorem on cycles
- On the anti-Ramsey numbers of linear forests
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- The rainbow number of matchings in regular bipartite graphs
- Anti-Ramsey number of matchings in a hypergraph
- Balanced edge-colorings avoiding rainbow cliques of size four
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)
