Extremal combinatorics, graph limits and computational complexity
<p>This thesis is primarily focused on problems in extremal combinatorics, although we will also consider some questions of analytic and algorithmic nature. </p> <p>The <em>d-dimensional hypercube</em> is the graph with vertex set {0,1}<sup><em>d</em>&...
| Hovedforfatter: | |
|---|---|
| Andre forfattere: | |
| Format: | Thesis |
| Sprog: | English |
| Udgivet: |
2016
|
| Fag: |