Haj\'os conjectured that every graph containing no subdivision of the complete $K_{s+1}$ is properly $s$-colorable. This conjecture was disproved by Catlin. Indeed, maximum chromatic number such graphs $\Omega(s^2/\log s)$. We prove $O(s)$ colors are enough for a weakening this only requires monochromatic component to have bounded size (so-called clustered coloring). Our approach leads more res...

In an interesting study recently published by your journal, Eini et al 1 addressed the epidemiological, clinical and laboratory findings among patients with brucellosis. They used hospital data in Hamadan. Accordingly, hospital admissions are selective and may lead to bias. Authors reported majority of patients (72.2%) were from rural areas in Hamadan City. This key finding has been supported b...

In this paper we prove a discrete version of Tanaka’s Theorem [19] for the Hardy-Littlewood maximal operator in dimension n = 1, both in the non-centered and centered cases. For the non-centered maximal operator f M we prove that, given a function f : Z→ R of bounded variation, Var(f Mf) ≤ Var(f), where Var(f) represents the total variation of f . For the centered maximal operator M we prove th...

most sweet cherry (prunus avium l.) cultivars are self-incompatible and have problems of ‎fertilization and fruit set. to produce commercial crops they need compatible and suitable ‎pollinizers. the compatibility of “zarde daneshkadeh”, “protiva”, “sorati lavasan”, “haj-yosefy” ‎and “meshkin shahr” cultivars with “shoa-o-saltaneh” as seed parent studied in a randomized ‎complete block design (r...

Uptil now most of the work is done on image, video, audio.but today the Database watermarking becomes the research topic because of the increasing the use of relational database systems. Which deals with the legal issue of copyright protection of database systems. .Watermarking is an information hiding technique which is used to embed a mark within some host content. In this paper,we have focus...

Our aim is to show that it is impossible to find a bound for the power of the first fixed point of the aleph function. 0 Introduction אα is called a fixed point of the א-function if אα = α. It is called the first fixed point if α is the least ordinal such that אα = α. More constructive, the first repeat point of the א-function is the limit of the following sequence א0,אא0 ,אאא0 ,אאאא0 , . . . T...