A Generalization Of Turán's Theorem To Directed Graphs
Document Type
Article
Publication Date
1980
Published In
Discrete Mathematics
Abstract
We consider an extremal problem for directed graphs which is closely related to Turán's theorem giving the maximum number of edges in a graph on n vertices which does not contain a complete subgraph on mvertices. For an integer n⩾2, let Tn denote the transitive tournament with vertex set Xn={1,2,3,…,n} and edge set {(i,j):1⩽i
Recommended Citation
Stephen B. Maurer , '67; I. Rabinovitch; and W. T. Trotter Jr..
(1980).
"A Generalization Of Turán's Theorem To Directed Graphs".
Discrete Mathematics.
Volume 32,
Issue 2.
167-189.
DOI: 10.1016/0012-365X(80)90250-2
https://works.swarthmore.edu/fac-math-stat/74