Referential thinking is the tendency to view innocuous stimuli as having a specific meaning for the self and is associated with personality traits and disorders. In three studies, this research examined the relations among referential thinking, self-processing, and paranoia. In study 1, follow-up questions on the Referential Thinking Scale (Lenzenweger, Bennett, & Lilenfeld, 1997) revealed that...

In this paper, we investigate the anti-Ramsey (more precisely, anti-van der Waerden) properties of arithmetic progressions. For positive integers n and k, the expression aw([n], k) denotes the smallest number of colors with which the integers {1, . . . , n} can be colored and still guarantee there is a rainbow arithmetic progression of length k. We establish that aw([n], 3) = Θ(log n) and aw([n...

A path in an edge-colored graph G, where adjacent edges may be colored the same, is called a rainbow path if no two edges of G are colored the same. For a κ-connected graph G and an integer k with 1 ≤ k ≤ κ, the rainbow k-connectivity rck(G) of G is defined as the minimum integer j for which there exists a j-edgecoloring of G such that every two distinct vertices of G are connected by k interna...

A rainbow colouring of a connected graph is a colouring of the edges of the graph, such that every pair of vertices is connected by at least one path in which no two edges are coloured the same. Such a colouring using minimum possible number of colours is called an optimal rainbow colouring, and the minimum number of colours required is called the rainbow connection number of the graph. A Chord...

Rainbow vertex-connection number is the minimum k-coloring on vertex graph G and denoted by rvc(G). Besides, rainbow-vertex connection can be applied to some special graphs, such as prism path graph. Graph operation a method used create new combining two graphs. Therefore, this research uses corona product form at resulting from of (Pm,2 P3) (P3 Pm,2). The results study obtain that theorem rain...

The van der Waerden theorem in Ramsey theory states that, for every k and t and sufficiently large N, every k-colouring of [N] contains a monochromatic arithmetic progression of length t. Motivated by this result, Radoičić conjectured that every equinumerous 3-colouring of [3n] contains a 3-term rainbow arithmetic progression, i.e., an arithmetic progression whose terms are coloured with distin...

A conjecture by Aharoni and Berger states that every family of n matchings of size n + 1 in a bipartite multigraph contains a rainbow matching of size n. In this paper we prove that matching sizes of ( 3 2 + o(1) ) n suffice to guarantee such a rainbow matching, which is asymptotically the same bound as the best-known one in the case where we only aim to find a rainbow matching of size n − 1. T...

Spice is an herbal mixture smoked for euphoria and mixed with synthetic cannabinoids that are undetected on urine drug screens. Spice use has increased in the military because it is considered legal and is not detected on urine drug screen. The authors describe 3 cases of Spice use in military members. Case 1: 19-year-old male presented with paranoia, agitation, and visual hallucinations after ...

Paranoia depicts a belief of others having harmful intent. Research using economic games has exhibited the correlation between paranoia and propensity to characterize ambiguous intentions as harmful. Using non-clinical sample recruited online from United States ( N =290), we examined whether paranoid thoughts influence aggressive behavior against subjective perception We conducted preemptive st...