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 “"Extremal problems (Mathematics)"”.

  1. Extremal problems for the Möbius function

    … D.)--Michigan State University. Department of Mathematics, 1993

    msu Repository record for Extremal problems for the Möbius function (opens in a new tab)

  2. Maximum Intersecting Families of Permutations

    In extremal set theory, the Erd}os-Ko-Rado (EKR) theorem gives an upper bound on the size of intersecting k-subsets of the set {1; : : : ;n}. Furthemore, it classi es the maximum-sized families of intersecting k-subsets. It has been shown that similar theorems can be proved for other mathematical …

    regina Repository record for Maximum Intersecting Families of Permutations (opens in a new tab) Download PDF for Maximum Intersecting Families of Permutations (opens in a new tab)

  3. Extremal Functions for Graph Linkages and Rooted Minors

    Extremal Functions for Graph Linkages and Rooted Minors Paul Wollan 137 pages Directed by: Robin Thomas A graph G is k-linked if for any 2k distinct vertices s_1,..., s_k,t_1,..., t_k there exist k vertex disjoint paths P_1,...,P_k such that the endpoints of P_i are s_i and t_i. Determining the …

    gatech Repository record for Extremal Functions for Graph Linkages and Rooted Minors (opens in a new tab)

  4. The Erdős-Ko-Rado Theorem for intersecting families of permutations.

    … Erdős-Ko-Rado Theorem is a fundamental result in extremal set theory. It describes the size and structure of the largest collection of subsets of size k from a set of size n having the property that any two subsets have at least t elements in common. Following the publication of the original …

    regina Repository record for The Erdős-Ko-Rado Theorem for intersecting families of permutations. (opens in a new tab) Download PDF for The Erdős-Ko-Rado Theorem for intersecting families of permutations. (opens in a new tab)

  5. Extremal Functions for Contractions of Graphs

    … cliques of size five. We then studied the extremal functions for complete minors. We proved that every simple graph on nge9 vertices and at least 7n-27 edges either has a minor, or is isomorphic to K_{2, 2, 2, 3, 3}, or is isomorphic to a graph obtained from disjoint copies of K_{1, 2, 2, …

    gatech Repository record for Extremal Functions for Contractions of Graphs (opens in a new tab)

  6. 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></sup> where two vertices are adjacent if they …

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

  7. Empirical likelihood and extremes

    In 1988, Owen introduced empirical likelihood as a nonparametric method for constructing confidence intervals and regions. Since then, empirical likelihood has been studied extensively in the literature due to its generality and effectiveness. It is well known that empirical likelihood has several …

    gatech Repository record for Empirical likelihood and extremes (opens in a new tab)

  8. Self-Assembly of DNA Graphs and Postman Tours

    … molecules to yield solutions to computational problems. Self-assembly of graphs have previously been shown to give polynomial time solutions to hard computational problems such as 3-SAT and k-colorability problems. Jonoska et al. have proposed studying self-assembly of graphs topologically, …

    unf Repository record for Self-Assembly of DNA Graphs and Postman Tours (opens in a new tab) Download PDF for Self-Assembly of DNA Graphs and Postman Tours (opens in a new tab)