Problems in extremal and probabilistic combinatorics by Morrison, N, Noel, J

“…<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>₀ vertices, and show that there is a unique graph that achieves this maximum. …”

Topics in extremal graph theory and probabilistic combinatorics by Roberts, A

“…<p>This thesis considers a variety of problems in Extremal Graph Theory and Probabilistic Combinatorics. Most of these problems are structural in nature, but some concern random reconstruction and parking problems.…”

Problems in extremal and probabilistic combinatorics: cubes, squares and permutations by Johnston, T

The critical mean-field random cluster model by Homer, A

Subjects: