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 8 of 8 for “"Set systems"”.

  1. Extremal Problems for Cycles, Paths and Set-Systems

    … apply in a more general sparse pseudo-random setting. We also prove a robustness-type result, showing the likely existence of cycles of prescribed lengths in a random subgraph of a graph with a nearly optimal density. Finally, we also present further applications of our main tool (the Key …

    cambridge Repository record for Extremal Problems for Cycles, Paths and Set-Systems (opens in a new tab)

  2. Tharaka Age-Organization and the Theory of Age-Set Systems

    Made available in DSpace on 2014-12-10T23:55:00Z (GMT). No. of bitstreams: 1 7412087.pdf: 7656679 bytes, checksum: ff8a6fcfe52aabeba4f8a6ecd46ddfef (MD5) Previous issue date: 1973

    uiuc Repository record for Tharaka Age-Organization and the Theory of Age-Set Systems (opens in a new tab)

  3. Extremal results for graphs and hypergraphs and other combinatorial problems

    … how small can maximal k-wise intersecting set systems over [n] be? Balogh, Chen, Hendrey, Lund, Luo, Tompkins and Tran resolved this problem for k=3, and for general k showed that the answer is between c_k·2^{n/(k−1)} and d_k·2^{n/⌈k/2⌉}. We prove that their lower bound gives the correct …

    cambridge Repository record for Extremal results for graphs and hypergraphs and other combinatorial problems (opens in a new tab)

  4. Colourings, dominating sets and wreaths

    … an extremal problem concerning dominating sets. We show that all forests with a given domination number $\gamma$ have at most ${5}^{\gamma/2}$ minimum dominating sets. Furthermore, for each $\gamma$, we construct a tree with domination number $\gamma$ which has more than …

    cambridge Repository record for Colourings, dominating sets and wreaths (opens in a new tab)

  5. Optimal Blocking for Three Treatments and BIBD Robustness - Two Problems in Design Optimality

    … in the one-way and multi-way heterogeneity settings, first proving optimality through a series of bounding arguments, then applying combinatorial techniques for their construction. Among the results established are optimality with respect to the well known E and A criteria. A- and E-optimal …

    vt Repository record for Optimal Blocking for Three Treatments and BIBD Robustness - Two Problems in Design Optimality (opens in a new tab)

  6. Endo knowledge, technology and power : the social construction of Endo material culture through age, gender and authority.

    … the thresholds which divide them . This study is set against the backdrop of literature on other East African societies , referring in particular to the sociopolitical organisation of traditional � age-set systems. In these societies there operates a male-oriented gerontocracy. Access to power and …

    cambridge

  7. Combinatorial structures in online and convex optimization

    … leads to interesting extremal questions on set systems and submodular functions. Next, we develop a general framework to simulate the well-known multiplicative weights update algorithm for online linear optimization over combinatorial strategies U in time polynomial in log /U/, using …

    mit Repository record for Combinatorial structures in online and convex optimization (opens in a new tab)

  8. Machine learning and combinatorial methods for discrete optimization problems

    … over combinatorial structures such as graphs or set systems. However, while classical combinatorial optimization assumes complete knowledge of all problem parameters, real-world applications often include uncertainty. Among the most important problems in this field are parallel machine scheduling …

    tu-berlin Repository record for Machine learning and combinatorial methods for discrete optimization problems (opens in a new tab)