On restricted colourings of \(K_ n\)
From MaRDI portal
Publication:793052
DOI10.1007/BF02579162zbMath0538.05047MaRDI QIDQ793052
Vera T. Sós, Miklós Simmonovits
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
05C55: Generalized Ramsey theory
Related Items
An anti-Ramsey theorem, 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., On Erdős-Rado numbers, Anti-Ramsey colorings in several rounds, Anti-Ramsey numbers of subdivided graphs, Rainbow numbers for matchings and complete graphs, On the extremal combinatorics of the Hamming space, Minimal colorings for properly colored subgraphs, An anti-Ramsey theorem on cycles, Rainbow numbers for certain graphs, Totally Multicolored diamonds
Cites Work