نتایج جستجو برای: minimal non

تعداد نتایج: 1446385  

Journal: :Bulletin of the Australian Mathematical Society 2004

2008
Alexander Balakin

The self-consistent system of master equations describing the kinetics of a relativistic non-Abelian plasma, influenced by curvature interactions, is formulated. Non-minimal (curvature induced) coupling is shown to modify all the subsystems of the model: the gauge field equations, the gravity field equations and the kinetic equation for colored particles.

2011
Saharon Shelah

We deal with abstract elementary classes K which has amalgamation in λ, categorical in λ and in λ. Our main result is that if (iω ≤ 2 < 2 + and) the minimal types on members of Kλ are not dense (among non algebraic (complete) types over models in Kλ, extending our given model), then the number of models in K of cardinality λ is maximal. For this we deal with some claims in pcf. This improves a ...

Journal: :ethno- pharmaceutical products 2014
sayed rasoul zaker shahin gavanji sayedeh sana sayedipour azizollah bakhtari elham shirani bidabadi

nowadays, many antibiotics are being used to control infectious diseases. inappropriate use of antibiotics leads to emergence of resistant bacteria and problems such as a prolonged course of treatment. medicinal plants and their derivatives, as a good source of treatment, are effective against drug resistance. in this study we have evaluated the antimicrobial activity of herbal essential oils o...

Journal: :CoRR 2011
José Antonio Martín H.

In this paper I study a variant of the general vertex coloring problem called precoloring. Specifically, I study graph precolorings, by developing new theory, for characterizing the minimal non-extensible precolorings. It is interesting per se that, for graphs of arbitrarily large chromatic number, the minimal number of colored vertices, in a nonextensible precoloring, remains constant; only tw...

Journal: :Graphs and Combinatorics 2015
Michael D. Barrus Stephen G. Hartke Mohit Kumbhat

Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degreesequence-forcing set if, for each graph G in the class C of F-free graphs, every realization of the degree sequence of G is also in C. A degreesequence-forcing set is minimal if no proper subset is degree-sequenceforcing. We characterize the non-minimal degree-sequ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید