Edge-coloring cliques with many colors on subcliques
From MaRDI portal
Publication:5928597
DOI10.1007/s004930070016zbMath0959.05041OpenAlexW2072808987MaRDI QIDQ5928597
Publication date: 1 April 2001
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930070016
Related Items
New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers, A (5,5)-Colouring of Kn with Few Colours, The Erdős-Gyárfás problem on generalized Ramsey numbers, Lower bounds on the Erdős–Gyárfás problem via color energy graphs, When is an Almost MonochromaticK4Guaranteed?, Coloring Triple Systems with Local Conditions, An application of the regularity lemma in generalized Ramsey theory, An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\)