Problems in extremal and probabilistic combinatorics
<p>In this thesis we consider some problems in extremal and probabilistic combinatorics.</p> <p>In Chapter 2 we determine the maximum number of induced cycles that can be contained in a graph on <em>n</em> ≥ <em>n</em><sub>0</sub> vertices, an...
| Main Authors: | , |
|---|---|
| Format: | Thesis |
| Published: |
2017
|