This web page contains the abstract of my paper:
"A Property of the Colored Complete Graph", Discrete Mathematics, 25(1979), p. 175-178.
Abstract: If the lines of the complete graph Kn are colored so that no point is on more than (n-1)/7 lines of the same color or so that each point lies on more than (5*n+8)/7 lines of different colors, then Kn contains a cycle of length n with adjacent lines having different colors.
IBM Research home page |
James B. Shearer's home page |
[ IBM home page | Order | Search | Contact IBM | Help | (C) | (TM) ]