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 96 for “"Extremal problems"”.

  1. 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)

  2. 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)

  3. 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)

  4. Extremal problems involving forbidden subgraphs

    In this thesis, we study extremal problems involving forbidden subgraphs. We are interested in extremal problems over a family of graphs or over a family of hypergraphs. In Chapter 2, we consider improper coloring of graphs without short cycles. We find how sparse an improperly critical graph can …

    uiuc Repository record for Extremal problems involving forbidden subgraphs (opens in a new tab)

  5. Extremal problems in graph theory

    We consider generalized graph coloring and other extremal problems in graph theory. We also construct twisted hypercubes of small radius and find the domination number of the Kneser graph $K(n,k)$ when $n\ge{3\over4}k\sp2\pm k,$ depending on whether k is even or odd. The path chromatic number …

    uiuc Repository record for Extremal problems in graph theory (opens in a new tab)

  6. Extremal problems in combinatorics and geometry

    This thesis is comprised of four chapters relating to combinatorics and geometry. More specifically, the main topics of the dissertation are incidence geometry and Euclidean Ramsey theory. In Chapter 2, we study the Erdős unit distance problem. In particular, we prove a structural result for …

    ubc Repository record for Extremal problems in combinatorics and geometry (opens in a new tab) Download PDF for Extremal problems in combinatorics and geometry (opens in a new tab)

  7. Coloring and extremal problems in combinatorics

    <p>Coloring problems concern partitions of structures. The classic problem of partitioning the set of integers into a finite number of pieces so that no one piece has an arithmetic progression of a fixed length was solved in 1927. Van der Waerden's Theorem shows that it is impossible to do so. The …

    iastate Repository record for Coloring and extremal problems in combinatorics (opens in a new tab)

  8. Some Extremal Problems in Ordered Structures

    Made available in DSpace on 2014-12-14T13:09:28Z (GMT). No. of bitstreams: 1 7616206.pdf: 1690442 bytes, checksum: 4c268ebfa7d097adf73d0e4168280d31 (MD5) Previous issue date: 1976

    uiuc Repository record for Some Extremal Problems in Ordered Structures (opens in a new tab)

  9. Extremal problems on special graph colorings

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

    uiuc Repository record for Extremal problems on special graph colorings (opens in a new tab)

  10. Extremal problems on counting combinatorial structures

    The fast developing field of extremal combinatorics provides a diverse spectrum of powerful tools with many applications to economics, computer science, and optimization theory. In this thesis, we focus on counting and coloring problems in this field. The complete balanced bipartite graph on $n$ …

    uiuc Repository record for Extremal problems on counting combinatorial structures (opens in a new tab)

  11. Extremal problems for the Möbius function

    Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1993

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

  12. SOME EXTREMAL PROBLEMS UNDER GROWTH/EXPANSION CONSTRAINTS

    Extremal combinatorics is the study of extremal properties of combinatorial objects under certain constraints. This thesis explores several extremal problems under growth and expansion constraints. The content beyond the Introduction (Chapter 1) is divided into three chapters, each associated with …

    nus Repository record for SOME EXTREMAL PROBLEMS UNDER GROWTH/EXPANSION CONSTRAINTS (opens in a new tab) Download file for SOME EXTREMAL PROBLEMS UNDER GROWTH/EXPANSION CONSTRAINTS (opens in a new tab)

  13. Extremal Problems for Graph Homomorphisms and Automata

    … the unexpected relationship between these problems; having a friendly vertex can be seen as satisfying Sidorenko's Conjecture in a local sense. We subsequently turn to a more modern, form of discrete model, cellular automata. Automata were first described by Von Neumann and Ulam and are …

    nebraska Repository record for Extremal Problems for Graph Homomorphisms and Automata (opens in a new tab)

  14. Extremal Problems in Graph Saturation and Covering

    This dissertation considers several problems in extremal graph theory with the aim of finding the maximum or minimum number of certain subgraph counts given local conditions. The local conditions of interest to us are saturation and covering. Given graphs F and H, a graph G is said to be …

    nebraska Repository record for Extremal Problems in Graph Saturation and Covering (opens in a new tab)

  15. Some Extremal Problems in Additive Number Theory

    We consider a measure t(n) for the efficiency of a representation of a large integer n as a sum of distinct squares, defined as the smallest sum of distinct natural numbers whose squares have sum n. Using a modified greedy algorithm, we give a precise asymptotic estimate for t(n) which shows, in …

    uiuc Repository record for Some Extremal Problems in Additive Number Theory (opens in a new tab)

  16. Structural and Extremal Problems in Graph Theory

    A mixed hypergraph H designates its edges as type C or D (or both). A strict k-coloring of H is a surjection c : X &rarr; {1,..., k} such that each C -edge has two vertices with common color and each D -edge has two vertices with distinct color. The feasible set of H is {k : H has a strict …

    uiuc Repository record for Structural and Extremal Problems in Graph Theory (opens in a new tab)

  17. Extremal problems on variations of graph colorings

    This thesis investigates various coloring problems in graph theory. Graph coloring is an essential part of combinatorics and discrete mathematics, as it deals with the fundamental problem of partitioning objects so that each part satisfies a certain condition. In particular, we study how forbidding …

    uiuc Repository record for Extremal problems on variations of graph colorings (opens in a new tab)

  18. Extremal problems on hypergraphs and set families

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

    uiuc Repository record for Extremal problems on hypergraphs and set families (opens in a new tab)

  19. Extremal Problems on Conformal Radii and Related Quantities

    … with center of mass of the compact set. Some problems on product of conformal radii will be discussed. One of them is a conjecture made by Dr. Solynin during one of his talks given at the Analysis seminar. He conjectured that among all convex domains containing the points -1 and 1, and having …

    ttu Repository record for Extremal Problems on Conformal Radii and Related Quantities (opens in a new tab)

Page 1 of 5