Description

Since the seminal work of Tur ́an, the forbidden subgraph problem has been among the central questions in extremal graph theory. Let ex(n;F) be the smallest number m such that any graph on n vertices with m edges contains F

Since the seminal work of Tur ́an, the forbidden subgraph problem has been among the central questions in extremal graph theory. Let ex(n;F) be the smallest number m such that any graph on n vertices with m edges contains F as a subgraph. Then the forbidden subgraph problem asks to find ex(n; F ) for various graphs F .

Downloads
pdf (7.1 MB)

Download count: 0

Details

Contributors
Date Created
2018
Resource Type
  • Text
  • Collections this item is in
    Note
    • Partial requirement for: Ph.D., Arizona State University, 2018
      Note type
      thesis
    • Includes bibliographical references (pages 96-98)
      Note type
      bibliography
    • Field of study: Mathematics

    Citation and reuse

    Statement of Responsibility

    by Jangwon Yie

    Machine-readable links