Description
The primary focus of this dissertation lies in extremal combinatorics, in particular intersection theorems in finite set theory. A seminal result in the area is the theorem of Erdos, Ko and Rado which finds the upper bound on the size of an intersecting family of subsets of an n-element set and characterizes the structure of families which attain this upper bound.
Download count: 0
Details
Contributors
- Kamat, Vikram M (Author)
- Hurlbert, Glenn (Thesis advisor)
- Colbourn, Charles (Committee member)
- Czygrinow, Andrzej (Committee member)
- Fishel, Susanna (Committee member)
- Kierstead, Henry (Committee member)
- Arizona State University (Publisher)
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
2011
Subjects
Resource Type
Collections this item is in
Note
- Partial requirement for: Ph. D., Arizona State University, 2011Note typethesis
- Includes bibliographical references (p
- Field of study: Mathematics
Citation and reuse
Statement of Responsibility
by Vikram M. Kamat