Given a real number every language that is weakly P n T hard for E or weakly P n T hard for E is shown to be exponentially dense This simultaneously strengthens results of Lutz and Mayordomo and Fu

Let G = (V,E) be a connected undirected graph. For any vertex v ∈ V , the closed neighborhood of v is N [v] = {v} ∪ {u ∈ V | uv ∈ E }. For S ⊆ V , the closed neighborhood of S is N [S] = ⋃ v∈S N [v]. The subgraph weakly induced by S is 〈S〉w = (N [S], E ∩ (S × N [S])). A set S is a weakly-connected dominating set of G if S is dominating and 〈S〉w is connected. The weakly-connected domination numb...

A Banach space E has the Grothendieck property if every (linear bounded) operator from E into c0 is weakly compact. It is proved that, for an integer k > 1, every k-homogeneous polynomial from E into c0 is weakly compact if and only if the space P(kE) of scalar valued polynomials on E is reflexive. This is equivalent to the symmetric k-fold projective tensor product of E (i.e., the predual of P...

In this paper, we introduce the notion of weakly e-continuous functions in topological spaces. Weak s-contlnulty and subweak continuity due to Rose [i] are independent of each other and are implied by weak continuity due to Levlne [2]. It is shown that weakly e-continuous surjections preserve connected spaces and that weakly e-contlnuous functions into regular spaces are continuous. Corollary i...

Aweak completeness phenomenon is investigated in the complexity class E = DTIME(2linear). According to standard terminology, a language H is m-hard for E if the set Pm(H), consisting of all languages A m H , contains the entire class E. A language C is P m-complete for E if it is m-hard for E and is also an element of E. Generalizing this, a language H is weakly m-hard for E if the set Pm(H) do...

A labeled graph is said to be weakly bipartite if the clutter of its odd cycles is ideal. Seymour conjectured that a labeled graph is weakly bipartite if and only if it does not contain a minor called an oddK5. A proof of this conjecture is given in this paper. Let G = (V;E) be a graph and E. We call edges in odd and edges in E even. The pair (G; ) is called a labeled graph. A subset L E(G) is ...