Let [n]r be the complete r-partite hypergraph with vertex classes of size n. It is an easy exercise to show that every set of more than (k − 1)nr−1 edges in [n]r contains a matching of size k. We conjecture the following rainbow version of this observation: If F1, F2, . . . , Fk ⊆ [n]r are of size larger than (k− 1)nr−1 then there exists a rainbow matching, i.e. a choice of disjoint edges fi ∈ ...

BACKGROUND Given the evidence that reasoning biases contribute to delusional persistence and change, several research groups have made systematic efforts to modify them. The current experiment tested the hypothesis that targeting reasoning biases would result in change in delusions. METHODS One hundred and one participants with current delusions and schizophrenia spectrum psychosis were rando...

The purpose of this study was to evaluate the effects of Scrophularia striata water extract on the quality and shelf life of the rainbow trout fillet during superchilled storage. Fish samples were treated with 1% and 3% S. striata water extract and then stored at -2°C for 20 days. The samples were analyzed periodically for chemical, microbial and sensory characteristics. Results indicated that ...

Given two graphs G and H, let f(G,H) denote the maximum number c for which there is a way to color the edges of G with c colors such that every subgraph H of G has at least two edges of the same color. Equivalently, any edge-coloring of G with at least rb(G,H) = f(G,H) + 1 colors contains a rainbow copy of H, where a rainbow subgraph of an edge-colored graph is such that no two edges of it have...

a new 2-[(4-substituted-phenyl-3-chloroazetidin-2-one)-5-(2'-methylamino 4-phenyl-1', 3'-thiazolyl-]-1, 3, 4-thiadiazoles, 5(a-n) were synthesized from 2-substituted-benzylideneamino-5-[2'-methylamino-4'-phenyl-1',3'-thiazolyl]-1,3, 4-thiadiazole, 4(a-n) using 2-amino-4phenyl-1, 3-thiazole as a starting material. the synthesised compounds have been screened in vitro for their antimicrobial acti...

Abstract. Let G be a nontrivial connected graph on which is defined a coloring N k k G E c ∈ → }, ,...., 3 , 2 , 1 { ) ( : , of the edges of G, where adjacent edges may be colored the same. A path in G is called a rainbow path if no two edges of it are colored the same. G is rainbow connected if G contains a rainbow v u − path for every two vertices u and v in it. The minimum k for which there ...

Suppose that k is a non-negative integer and a bipartite multigraph G is the union of N = ⌊ k + 2 k + 1 n ⌋ − (k + 1) matchings M1, . . . ,MN , each of size n. We show that G has a rainbow matching of size n− k, i.e. a matching of size n− k with all edges coming from different Mi’s. Several choices of parameters relate to known results and conjectures. Suppose that a multigraph G is given with ...

The purpose of this study was to investigate the effects of subclinical paranoia on social perception and behavior. Two groups of participants, those high and low in subclinical paranoia, were identified based on extreme scores on the Paranoia Scale (PS). As expected, persons high in subclinical paranoia had greater depression, social anxiety, self-consciousness, and lower self-esteem compared ...

The susceptibility of 2 strains of rainbow trout Oncorhynchus mykiss, 1 from North America (TL) and 1 from Germany (GR), to Myxobolus cerebralis (the cause of salmonid whirling disease) was assessed following exposure to the infectious stages (triactinomyxons). Two laboratory experiments were conducted with age-matched rainbow trout of each strain. At the beginning of the study, the 2 trout str...

An edge-coloured graph G is called rainbow-connected if any two vertices are connected by a path whose edges have different colours. This concept of rainbow connection in graphs was recently introduced by Chartrand et al. in [4]. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order to make G rainbow connected. An easy ob...