Results 31 to 40 of about 5,610 (306)
On the Non-(p−1)-Partite Kp-Free Graphs
We say that a graph G is maximal Kp-free if G does not contain Kp but if we add any new edge e ∈ E(G) to G, then the graph G + e contains Kp. We study the minimum and maximum size of non-(p − 1)-partite maximal Kp-free graphs with n vertices.
Amin Kinnari +3 more
doaj +1 more source
ON AN EXTREMAL PROBLEM FOR NONOVERLAPPING DOMAINS [PDF]
The paper considers the problem of finding the range of functional I = J f (z 0), f (z 0), F ($ζ$ 0), F ($ζ$ 0) , defined on the class M of pairs functions (f (z), F ($ζ$)) that are univalent in the system of the disk and the interior of the disk, using the method of internal variations.
Pchelintsev, Evgeny A. +1 more
openaire +4 more sources
Diameter problems for univalent functions with quasiconformal extension
This paper utilizes the method of extremal length to study several diameter problems for functions conformal outside of a disc centered at the origin, with a standard normalization, which possess a quasiconformal extension to a ring subdomain of this ...
Paul Deiermann
doaj +1 more source
Extremal classical interpolation problems (matrix case) [PDF]
In this paper, we try to find amongst the solutions w(z) of the corresponding interpolation problem the solution which satisfies an additional extremal condition.
Sakhnovich, L.A. +2 more
core +1 more source
Extremal optimisation for assignment type problems [PDF]
Extremal optimisation is an emerging nature inspired meta-heuristic search technique that allows a poorly performing solution component to be removed at each iteration of the algorithm and replaced by a random value.
Andrew Lewis (63672) +2 more
core +3 more sources
Constrained extremal solutions of multi-valued linear inclusions in Banach spaces
Let X and Y be Banach spaces, L be a linear manifold in X × Y $X\times Y$ , or, equivalently, the graph of a multi-valued linear operator from X to Y, and let S be a prescribed hyperplane in X, i.e. S = g + N $S=g+N$ .
Zi Wang, Boying Wu, Yuwen Wang
doaj +1 more source
Problems and results in extremal combinatorics—II [PDF]
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoretical Computer Science, Geometry and Game Theory.
Alon, Noga, Noga Alon
core +1 more source
Extra Edge Connectivity and Extremal Problems in Education Networks
Extra edge connectivity and diagnosability have been employed to investigate the fault tolerance properties of network structures. The p-extra edge connectivity λp(Γ) of a graph Γ was introduced by Fàbrega and Fiol in 1996.
Hongfang Liu +2 more
doaj +1 more source
Extremal Problems for Geometric Hypergraphs [PDF]
Bounds for the largest number of edges (\(i\)-simplices) in a geometric hypergraph with forbidden configurations such as intersecting edges, crossing edges, pairwise crossing edges, etc., are derived. Some of the bounds are tight.
Tamal K. Dey, János Pach
openaire +2 more sources
ABSTRACT Introduction Anthracycline‐related cardiac remodeling precedes heart failure in childhood cancer survivors. The objectives of this study were to determine the relationships between patient‐specific factors, moderate‐to‐vigorous physical activity (MVPA), and cardiac remodeling.
Hari K. Narayan +15 more
wiley +1 more source

