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 . The question can be further generalized by asking for the extreme values of other graph parameters like minimum degree, maximum degree, or connectivity. We call this type of question a Tura ́n-type problem.
Download count: 0
- Partial requirement for: Ph.D., Arizona State University, 2018Note typethesis
- Includes bibliographical references (pages 96-98)Note typebibliography
- Field of study: Mathematics