The Number Of Orientations Having No Fixed Tournament

Let T be a fixed tournament on k vertices. Let D(n, T) denote the maximum number of orientations of an n-vertex graph that have no copy of T. We prove that D(n, T) = 2tk-1(n) for all sufficiently (very) large n, where tk-1(n) is the maximum possible number of edges of a graph on n vertices with no Kk, (determined by Tur

• Type: Journal
• Year: 2006
• Where: COMBINATORICA
• Authors: Noga Alon, Raphael Yuster
• Keywords: COMBINATORICA 2006, Fixed Tournament, Maximum Possible Number, Regularity Lemma