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 46 for “"Extremal problems"”.
-
Extremal Problems for Hypergraphs
We study various extremal problems on hypergraphs
-
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 …
-
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 …
-
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
-
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
-
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$ …
-
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 …
-
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 → {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 …
-
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 …
-
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
-
Extremal problems for polynomials and power series
Thesis (Ph.D.) Massachusetts Institute of Technology. Dept. of Mathematics, 1952.
-
Extremal problems for polynomials and power series
Thesis (M.S.) Massachusetts Institute of Technology. Dept. of Mathematics, 1951.
-
Extremal Problems on Linkage and Packing in Graphs
Made available in DSpace on 2015-09-28T15:19:58Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3243039.pdf: 3424571 bytes, checksum: e15dc8f744cf0542d5bfd8104c34df11 (MD5) Previous issue date: 2006
-
Some Extremal Problems on Graphs and Partial Orders
A unichain in a product poset P x Q is a chain in which the value of one coordinate is fixed. A semiantichain in P x Q is a family S such that (u, v) < ( u', v') for two elements of S only if u < u' and v < v' . Saks and West conjectured that for every product of partial orders, the maximum size of …
-
Extremal Problems in Combinatorics: Covering and Coloring Problems
The Ramsey-type coloring problems we consider include generalized Ramsey and generalized Anti-Ramsey problems. Namely, what is the minimal (or maximal) number of colors on the edges of a graph such that every subgraph isomorphic to some fixed graph uses at most q2 and at least q1 colors on its …
-
Extremal problems in disjoint cycles and graph saturation
… of matchings and describe the assiociated extremal graphs. An induced version of graph saturation was suggested by Martin and Smith. In order to offer a parameter that is defined for all forbidden graphs, Martin and Smith consider generalized graphs, called trigraphs. Of particular interest …
-
Some Extremal Problems of Number Theory and Geometry
Made available in DSpace on 2014-12-11T18:24:13Z (GMT). No. of bitstreams: 1 7511750.pdf: 2716895 bytes, checksum: 1ccf096d5f2fbadd9ccb24b67dcf0f41 (MD5) Previous issue date: 1974
-
Extremal problems for cycles in graphs and hypergraphs
… we study several generalizations of Turan type problems in graphs and hypergraphs. In particular, we focus on graphs and hypergraphs without long cycles or long paths, extending famous results of Erdos and Gallai. Results include bounds on the size of such objects as well as stability theorems …
-
Extremal Problems for Cycles, Paths and Set-Systems
… a different combinatorial problem. What ties all problems considered in this thesis together is their extremal nature and the probabilistic point of view taken in their formulations or analysis. In the first three chapters we consider extremal questions regarding cycles. Cycles in graphs are one …
-
Extremal problems in combinatorial geometry and Ramsey theory
… settings. We make contributions to specific problems in combinatorial geometry, Ramsey theory and graph theory. We first study extremal questions in geometric graph theory, that is, the existence of collections of edges with a specified crossing pattern in drawings of graphs in the plane with …
Page 1 of 3