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 20 of 739 for “"Extremal"”.

  1. Extremal Cayley Graphs

    … is one of the central problems in the study of extremal Cayley digraphs. Let ℤm denote the cyclic group of residue classes of integers modulo m with addition. Given any two positive integers d and k, define m(d, k) as the largest positive integer m such that there exists a set A of k integers …

    texas-state Repository record for Extremal Cayley Graphs (opens in a new tab)

  2. Understanding extremal axioms

    … philosophical, and mathematical aspects of extremal axioms, i.e., principles that impose either minimality or maximality conditions on the admissible models of an axiomatic theory. What motivates a unified treatment of these axioms is that they entail that the domain D of the intended model …

    lmu-germany Repository record for Understanding extremal axioms (opens in a new tab)

  3. Extremal Covariance Matrices

    … coefficient (TDC) is a natural tool to describe extremal dependence. Estimation of the tail dependence coefficient can be performed via empirical process theory. In case of extremal independence, the limit degenerates and hence one cannot construct a test for extremal independence. In order to …

    ottawa-retro Repository record for Extremal Covariance Matrices (opens in a new tab)

  4. Extremal properties of eigenvalues

    <p>In this work, we examine eigenvalues of ordinary and generalized Sturm- Liouville problems. We begin by considering the general boundary value problem -y"(t) + q(t)y(t) = λy(t), {cos α)y(a) - {sin α)y'(a) = 0, (cos β)y(b) - (sin β)y'(b) = 0, where -∞ < a ≤ t ≤ b< ∞, 0 ≤ α < π, 0 < β ≤ π, and …

    utk-theses Repository record for Extremal properties of eigenvalues (opens in a new tab)

  5. Extremal problems in graphs

    In the first part of this thesis we will consider degree sequence results for graphs. An important result of Komlós [39] yields the asymptotically exact minimum degree threshold that ensures a graph \(G\) contains an \(H\)-tiling covering an \(x\)-proportion of the vertices of \(G\) (for any fixed …

    birmingham Download PDF for Extremal problems in graphs (opens in a new tab)

  6. Problems in extremal combinatorics

    In this thesis, we prove results in extremal combinatorics. The thesis is divided into three parts. In the first part, for fixed integers $n \ge k \ge 2$ and $s \ge 2$, we study the chromatic number of the subgraphs of the Kneser graph $\textrm{KG}(n,k)$ induced by the family the $s$-stable sets in …

    iastate Repository record for Problems in extremal combinatorics (opens in a new tab)

  7. Extremal trees and reconstruction

    … will be considered. First, I will consider extremal problems for trees. In these questions we examine the trees that maximize or minimize various invariants. For instance the number of independent sets, the number of matchings, the number of subtrees, the sum of pairwise distances, the …

    nebraska Repository record for Extremal trees and reconstruction (opens in a new tab)

  8. Problems in extremal combinatorics

    We consider a variety of problems in extremal graph and set theory. Given a property $\Gamma$ and a family of sets ${\mathcal F}$, let $f({\mathcal F},\Gamma)$ be the size of the largest subfamily of ${\mathcal F}$ having property $\Gamma$. Let $f(m,\Gamma)$ be the minimum of $f({\mathcal …

    uiuc Repository record for Problems in extremal combinatorics (opens in a new tab)

  9. Extremal problems in Bergman spaces

    In this dissertation, we shall study non-linear extremal problems in Bergman space $\mathcal{A}^2(\mathbb{D})$. We show the existence of the solutions and that the extremal functions are bounded. Further, we shall discuss special cases for polynomials, investigate the properties of the solution and …

    ttu Repository record for Extremal problems in Bergman spaces (opens in a new tab)

  10. New results in extremal combinatorics

    Extremal problems, in general, ask for the optimal size of certain finite objects when some restrictions are imposed. In extremal combinatorics, a major field in combinatorics, one studies how global properties guarantee the existence of local substructures, or equivalently, how avoiding local …

    ubc Repository record for New results in extremal combinatorics (opens in a new tab) Download PDF for New results in extremal combinatorics (opens in a new tab)

  11. Spectral Methods in Extremal Combinatorics

    Extremal combinatorics studies how large a collection of objects can be if it satisfies a given set of restrictions. Inspired by a classical theorem due to Erdos, Ko and Rado, Simonovits and Sos posed the following problem: determine how large a collection of graphs on the vertex set {1,...,n} can …

    toronto-retro Repository record for Spectral Methods in Extremal Combinatorics (opens in a new tab)

  12. Extremal Directed And Mixed Graphs

    We consider three problems in extremal graph theory, namely the degree/diameter problem, the degree/geodecity problem and Tur\'{a}n problems, in the context of directed and partially directed graphs. A directed graph or mixed graph $G$ is $k$-geodetic if there is no pair of vertices $u,v$ of $G$ …

    the-open-u Download PDF for Extremal Directed And Mixed Graphs (opens in a new tab)

  13. Properties of extremal convex bodies

    In 1948 Besicovitch proved that an affine image of a regular hexagon may be inscribed into an arbitrary planar convex body. We prove Besicovitch's result using a variational approach based on special approximation by triangles and generalize the Besicovitch theorem to a certain new class of …

    manitoba Repository record for Properties of extremal convex bodies (opens in a new tab)

  14. Extremal structure of convex sets

    "Let X be a locally compact closed convex subset of a locally convex Haus Dorff topological linear space E. It is shown that every exposed point, respectively, ray of Xis a strongly exposed point, respectively, ray of X. Also, every extreme point, respectively, ray of Xis a denting point, …

    must-thes Repository record for Extremal structure of convex sets (opens in a new tab)

  15. Three Essays on Extremal Quantiles

    <p>Extremal quantile index is a concept that the quantile index will drift to zero (or one)</p><p>as the sample size increases. The three chapters of my dissertation consists of three</p><p>applications of this concept in three distinct econometric problems. In Chapter 2, I</p><p>use the concept of …

    duke Repository record for Three Essays on Extremal Quantiles (opens in a new tab)

  16. Extremal Problems in Matroid Connectivity

    Matroid k-connectivity is typically defined in terms of a connectivity function. We can also say that a matroid is 2-connected if and only if for each pair of elements, there is a circuit containing both elements. Equivalently, a matroid is 2-connected if and only if each pair of elements is in a …

    lsu-thes Repository record for Extremal Problems in Matroid Connectivity (opens in a new tab)

Page 1 of 37