The Maximum Size of an Edge Cut and Graph Homomorphisms

References

[1] A. J. Bondy and U. S. R. Murty, “Graph Theory with Applications,” American Elsevier, New York, 1976.

[2] P. Erd?s, “Problems and Results in Graph Theory and Combinatorial Analysis,” Graph Theory and RelatedTopics, Academic Press, New York, 1979.

[3] M. O. Albertson and K. L. Gibbons, “Ho-momorphisms of 3-Chromatic Graphs,” Discrete Mathe-matics, Vol. 54, No. 2, 1985, pp. 127-132.
doi:10.1016/0012-365X(85)90073-1

[4] M. O. Albert-son, P. A. Catlin and L. Gibbons, “Homomorphisms of 3-Chromatic Graphs II,” Congressus Numerantium, Vol. 47, 1985, pp. 19-28.

[5] P. A. Catlin, “Graph Homo-morphisms onto the 5-Cycle,” Journal of Combinatorial Theory, Series B, Vol. 45, No. 2, 1988, pp. 199-211.
doi:10.1016/0095-8956(88)90069-X

[6] E. R. Schei-nerman and D. H. Ullman, “Fractional Graph Theory,” John Wiley Sons, Inc., New York, 1997.

[7] G. G. Gao and X. X. Zhu, “Star-Extremal Graphs and the Lexico-graphic Product,” Discrete Mathematics, Vol. 153, 1996, pp. 147-156.

[8] S. Poljak and Z. Tuza, “Maximum Bi-partite Subgraphs of Kneser Graphs,” Graphs and Com-binatorics, Vol. 3, 1987, pp. 191-199. doi:10.1007/BF01788540