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 209 for “"Extremal"”.
-
Extremal Problems for Hypergraphs
We study various extremal problems on hypergraphs
-
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 …
-
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 …
-
Problems in Extremal Graph Theory
What is the maximum number of edges in a multigraph on n vertices if every k-set spans at most r edges? We asymptotically determine this maximum for almost all k and r as n tends to infinity, thus giving a generalization of Turan's theorem. We find exact answers in many cases, even when edges of …
-
Extremal Discs and CR Geometry
… A determination of the dimension of the set of extremal discs attached to a CR strictly pseudoconvex manifold of codimension two in C 4: we prove that, for such a manifold, extremal discs depend on 15 parameters, one more than the parameters needed to describe extremal discs attached to a …
-
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 …
-
Topics in extremal graph theory
New results are proved on several problems in extremal graph theory.
-
Problems in extremal graph theory
We consider a variety of problems in extremal graph and set theory. The {\em chromatic number} of $G$, $\chi(G)$, is the smallest integer $k$ such that $G$ is $k$-colorable. The {\it square} of $G$, written $G^2$, is the supergraph of $G$ in which also vertices within distance 2 of each other in …
-
Extremal Combinatorics and Universal Algorithms
… combinatorics of partially ordered sets and extremal combinatorics. Firstly, we focus on some new automata that do not seem to have occurred much in the literature, that of solvability of mazes. For our model, a maze is a countable strongly connected digraph together with a proper colouring …
-
Extremal and probabilistic bootstrap percolation
In this dissertation we consider several extremal and probabilistic problems in bootstrap percolation on various families of graphs, including grids, hypercubes and trees. Bootstrap percolation is one of the simplest cellular automata. The most widely studied model is the so-called r-neighbour …
-
Predictive and adaptive extremal control
The time-optimal predictive control strategy for second order relay or bang-bang control systems is investigated along with modifications of this strategy for third order systems. One basis of this strategy is the utilization of a model, a replica of the plant, run in a fast-time mode so as to …
-
Log geometry and extremal contractions
The Minimal Model Program (in short, MMP) aims at classifying projective algebraic varieties from a birational point of view. That means that starting from a projective algebraic variety X, [Delta] it is allowed to change the variety under scrutiny as long as its field of rational functions remains …
-
Extremal Graph Theory and Enumerative Combinatorics
<p>This thesis consists of research on two topics.The first topic is about different middle parts of trees, such as center, centroid, subtree core. In this work, we considered how far apart (with given order of the tree) two different `middle points' can be and when such maximum distances are …
-
Extremal graph theory: supersaturation and enumeration
… supersaturation and enumeration problems in extremal combinatorics. In Chapter 2, with Balogh, we disprove a conjecture of Erdos and Tuza concerning the number of different ways one can create a copy of K_4, a complete graph on 4 vertices, in a K_4-free graph. In Chapter 3, we extend a …
-
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 effects in rotationally inelastic diffraction
… effect the scattered distributions. This effect, extremal scattering, has been explained in terms of a simple mechanism, allowing accurate calculation of the scattering profiles and angles. The scattering of helium along both the [110] and the [100] azimuths has also been studied. Anomalous shifts …
-
Topics in extremal and algebraic combinatorics
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms
Page 1 of 11