We establish some relative volume comparison theorems for extremal volume forms of‎ ‎Finsler manifolds under suitable curvature bounds‎. ‎As their applications‎, ‎we obtain some results on curvature and topology of Finsler manifolds‎. ‎Our results remove the usual assumption on S-curvature that is needed in the literature‎.

In this paper, we prove the existence and uniqueness results to the random fractional functional differential equations under assumptions more general than the Lipschitz type condition. Moreover, the distance between exact solution and appropriate solution, and the existence extremal solution of the problem is also considered.

We construct multi-center solutions for charged, dilatonic, non-extremal black holes in D = 4. When an infinite array of such non-extremal black holes are aligned periodically along an axis, the configuration becomes independent of this coordinate, which can therefore be used for Kaluza-Klein compactification. This generalises the vertical dimensional reduction procedure to include non-extremal...

After summarizing the development of black hole thermodynamics in the seventies, we describe a recent microscopic model. This model suggests that the Bekenstein-Hawking area formula holds for extremal black holes as well as for ordinary (non-extremal) ones. On the other hand, semiclassical studies have suggested a discontinuity between non-extremal and extremal cases. We indicate how a reconcil...

An extremal graph for a graph H on n vertices is a graph on n vertices with maximum number of edges that does not contain H as a subgraph. Let Tn,r be the Turán graph, which is the complete r-partite graph on n vertices with part sizes that differ by at most one. The well-known Turán Theorem states that Tn,r is the only extremal graph for complete graph Kr+1. Erdős et al. (1995) determined the ...

When considering the total number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to some other graphical indices in applications. Along this line, it is interesting to study that over some types of trees with a given order, which trees minimize or maximize this number...

ON MAXIMAL LAYERS OF RANDOM ORDERS Indranil Banerjee George Mason University, 2015 Thesis Director: Dr. Dana Richards In this thesis we investigate the maximal layers of random partial orders. Main contributions are two-fold. In the first half we investigate the expected size of different maximal layers of a random partial order. In particular when the points are in a plane, we give an enumerat...

If you get the printed book in on-line book store, you may also find the same problem. So, you must move store to store and search for the available there. But, it will not happen here. The book that we will offer right here is the soft file concept. This is what make you can easily find and get this extremal combinatorics with applications in computer science by reading this site. We offer you...