Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"container method"”.

  1. Random and deterministic versions of extremal poset problems

    … discuss a new technique called the Hypergraph Container Method in depth and use it to prove a random version of De Bonis and Katona's (r+1)-fork-free theorem.</p>

    iastate Repository record for Random and deterministic versions of extremal poset problems (opens in a new tab)

  2. Counting X-free sets

    … result is obtained using the powerful hypergraph container method. Further, it generalizes previous work of Balogh, Liu, and Sharifzadeh and Kim. This thesis includes joint work with Natalie Behague, Joseph Hyde, Natasha Morrison, and Jonathan A. Noel.

    uvic Repository record for Counting X-free sets (opens in a new tab)

  3. On some problems in extremal, probabilistic and enumerative combinatorics

    … ingredient to a very recently discovered proof method, called the Container method. Chapters 3 and 4 show various examples of this method in action. In Chapter 3 we, among others, give tight bounds on the logarithm of the number of $t$-error correcting codes and illustrate how the Container …

    uiuc Repository record for On some problems in extremal, probabilistic and enumerative combinatorics (opens in a new tab)

  4. Enumerating combinatorial objects with limited sub-configurations

    … problem, we introduce a new variant of the graph container algorithm. Another application of it to additive combinatorics is presented in Chapter 3 on generalized Sidon sets. In Chapter 4, we investigate an enumeration problem on Gallai colorings, i.e. rainbow triangle-free colorings. In …

    uiuc Repository record for Enumerating combinatorial objects with limited sub-configurations (opens in a new tab)

  5. Enumerating matroid extensions

    This thesis investigates the problem of enumerating the extensions of certain matroids. A matroid M is an extension of a matroid N if M delete e is equal to N for some element e of M. Similarly, a matroid M is a coextension of a matroid N if M contract e is equal to N for some element e of M. In …

    waterloo Repository record for Enumerating matroid extensions (opens in a new tab)

  6. A Novel Sol-Gel Silica Formulation for Management of Methadone Hydrochloride Abuse

    … and reduce the frequent visits to MMT centres. Methods: For MDN recrystallisation, a closed container method (CCM) and hot-stage method (HSM) were conducted, and MDN crystals were characterised using the polarised light microscope (PLM). MDN crystal thickness was determined by scanning electron …

    kings Repository record for A Novel Sol-Gel Silica Formulation for Management of Methadone Hydrochloride Abuse (opens in a new tab)

  7. Extremal properties of some random combinatorial systems

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-02-04 without embargo terms

    uiuc Repository record for Extremal properties of some random combinatorial systems (opens in a new tab)

  8. Extremal combinatorics, graph limits and computational complexity

    … Chapter 6 along with the recently developed 'container method,' to obtain an upper bound on the number of antichains in 𝒱(<em>q,n</em>) and a bound on the size of the largest antichain in a p-random subset of 𝒱(<em>q,n</em>) which holds with high probability for p in a certain range. </p> …

    oxford Repository record for Extremal combinatorics, graph limits and computational complexity (opens in a new tab)

  9. A statistical physics approach to probabilistic combinatorics

    … expansion of polymer models and the graph container method, we investigate this phenomenon in several different contexts. <br class="SCXW32906736 BCX8" style="-webkit-user-drag: none; -webkit-tap-highlight-color: transparent; margin: 0px; padding: 0px; user-select: text; white-space: pre …

    kings Repository record for A statistical physics approach to probabilistic combinatorics (opens in a new tab) Download PDF for A statistical physics approach to probabilistic combinatorics (opens in a new tab)