منابع مشابه
On a Quasi-Ramsey problem
It is proved that if a graph G has at least cn log n vertices, then either G or its complement G contains a subgraph H with at least n vertices and minimum degree at least I V(H) I /2. This result is not far from being best possible, as is shown by a rather unusual random construction . Some related questions are also discussed .
متن کاملOn the Euler-lagrange Equation for a Variational Problem
where g : R 7→ R strictly monotone increasing and differentiable, Ω open set with compact closure in R , and D convex closed subset of R. Under the assumption that ∇ū ∈ D a.e. in Ω, there is a unique solution u to (1.1) and we can actually give an explicit representation of u is terms of a Lax-type formula. The solution is clearly Lipschitz continuous because ∇u ∈ ∂D a.e. in Ω. The Euler-Lagran...
متن کاملQuasi-regular Relations – a New Class of Relations on Sets
Following Jiang Guanghao and Xu Luoshan’s concept of conjugative, dually conjugative, normal and dually normal relations on sets, the concept of quasi-regular relations is introduced. Characterizations of quasi-regular relations are obtained and it is shown when an anti-order relation is quasiregular. Some nontrivial examples of quasi-regular relations are given. At the end we introduce dually ...
متن کاملA Free Boundary Problem for a Quasi-linear Degenerate Elliptic Equation: Regular Reflection of Weak Shocks
We prove the existence of a solution to the weak regular reflection problem for the unsteady transonic small disturbance (UTSD) model for shock reflection by a wedge. In weak regular reflection, the state immediately behind the reflected shock is supersonic and constant. The flow becomes subsonic further downstream; the equation in self-similar coordinates is degenerate at the sonic line. The r...
متن کاملQuasi-regular Tessellation of Hexagons
A tessellation is a process that surrounds us every day. It is an old problem in mathematics and in computational geometry Preparata, 1985 . Several tessellations are known, although only some of them are interesting in the computational geometry. The main aim of the tessellation is to tile or divide the space of the interest into smaller parts tiles upon which other problems could be solved mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1990
ISSN: 0022-247X
DOI: 10.1016/0022-247x(90)90311-3