Abstract
Given a sample graphH and two integers,n andr, we colourK n byr colours and are interested in the following problem.
Which colourings of the subgraphs isomorphic to H in K n must always occur (and which types of colourings can occur whenK n is coloured in an appropriate way)?
These types of problems include theRamsey theory, where we ask: for whichn andr must a monochromaticH occur. They also include theanti-Ramsey type problems, where we are trying to ensure a totally multicoloured copy ofH, that is, anH each edge of which has different colour.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Alon, On a conjecture of Erdős, T. Sós and Simonovits,J. Graph Theory, to appear.
F. R. K. Chung andR. L. Graham, Edge-coloured complete graphs with precisely coloured subgraphs,Combinatorica 3 (3–4), (1983) 315–324.
P. Erdős, Some recent results in extremal graph problems in graph theory,Theory of Graphs, Proc. Symp. Rome (1966), 118–123.
P. Erdős andT. Gallai, On maximal paths and circuits of graphs,Acta Math. Acad. Sci. Hung. 10 (1959), 337–356.
P. Erdős andM. Simonovits, A limit theorem in graph theory,Studia Sci. Math. Hung. 1 (1966), 51–57.
P. Erdős, M. Simonovits andV. T. Sós, Anti-Ramsey theorems,Coll. Math. Soc. J. Bolyai 10, Infinite and finite sets, Keszthely (Hungary), 1973, 633–642.
R. J. Faudree andR. H. Schelp, Ramsey type results,Coll. Math. Soc. J. Bolyai 10. Infinite and finite sets, Keszthely (Hungary), 1973, 657–665.
M. Simonovits, A method for solving extremal problems in graph theory, stability problems,Theory of Graphs, Proc. Symp. held at Tihany, Hungary (1966), Acad. Press, New York (1968), 279–319.
Author information
Authors and Affiliations
Additional information
Dedicated to Paul Erdős on his seventieth birthday