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

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.

Reuse Permissions
  • Downloads
    pdf (401.8 KB)

    Download count: 0

    Details

    Contributors
    Date Created
    2011
    Resource Type
  • Text
  • Collections this item is in
    Note
    • Partial requirement for: Ph. D., Arizona State University, 2011
      Note type
      thesis
    • Includes bibliographical references (p
    • Field of study: Mathematics

    Citation and reuse

    Statement of Responsibility

    by Vikram M. Kamat

    Machine-readable links