Abstract
dc:descriptionWhat 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.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Kundgen, Andre
- Contributors dc:contributor
-
- Furedi, Zoltan
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI9953067
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/86984