Problems in Extremal Graph Theory

106 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999.What is the maximum number of edges in a multigraph on n vertices if every k-set spans at most r edges? We asymptotically determine this maximum for almost all k and r as n tends to infinity, thus giving a generalization of Turan's theorem. We find exact answers in many cases, even when edges of negative multiplicity are allowed.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD