1. Independence and Graph Homomorphism;Albertson;J. Graph Theory,1993
2. Graphentheoretische Extremalprobleme;Andrásfai;Acta Math. Acad. Sci. Hungar.,1964
3. On the connection between chromatic number, maximal clique and minimal degree of a graph;Andrásfai;Discrete Math.,1974
4. S. Brandt and E. Ribe-Baumann, Dense graphs with large odd girth, submitted
5. S. Brandt and S. Thomassé, Dense triangle-free graphs are four-colorable: A solution to the Erdős-Simonovits problem, to appear in J. Comb. Theory B.