Stimulus-induced response conflict (e.g., in Simon or Stroop tasks) is often reduced after conflict trials-the Gratton effect. It is generally assumed that this effect is due to a strengthening of the representation of the current intention or goal, which in turn increases the degree of stimulus and/or response control. Recent evidence suggests that the motivational signal driving the Gratton e...

All graphs in this paper are understood to be finite, undirected, without loops or multiple edges. The graph G' = (V', E') is called an induced subgraph of G = (V, E) if V' ~ V and uv E E' if and only if {u, v} ~ V', uv E E. The following two problems about induced matchings have been formulated by Erdos and Nesetril at a seminar in Prague at the end of 1985: 1. Determine f(k, d), the maximum n...

BACKGROUND Despite the high comorbidity of anxiety and depression in people with multiple sclerosis (MS), little is known about their inter-relationships. Both involve emotional perturbations and the way in which emotions are processed is likely central to both. The aim of the current study was to explore relationships between the domains of mood, emotional processing and coping and to analyse ...

Several years ago B. Alspach asked the following question. If IZ is odd and a,+a,+.. . + a, = n(n 1)/2 (if n is even and u1u2 + . . . + a, = n(n 2)/2), 3 6 a, c it, can the edges of the complete graph K, (the edges of K,, F, the complete graph from which a l-factor has been removed) be partitioned into m cycles C,,, C,,, . . . , C,_ where Cat has length ai [l]? When all cycles are required to h...

We call a graph 2K2-free if it is connected and does not contain two independent edges as an induced subgraph. The assumption of connectedness in this definition only serves to eliminate isolated vertices. Wagon [6] proved that x(G) ~ w(G)[w(G) + 1]/2 if G is 2Krfree where x(G) and w(G) denote respectively the chromatic number and maximum clique size of G. Further properties of 2K2-free graphs ...

We call a graph 2K,-free if it is connected and does not contain two independent edges as an induced subgraph. The assumption of connectedness in this definition only serves to eliminate isolated vertices. Wagon [6] proved that x(G)co(G)[o(G)+ 1]/2 if G is 2K,-free where x(G) and w(G) denote respectively the chromatic number and maximum clique size of G. Further properties of 2Kz-free graphs ha...

BACKGROUND A number of characteristics associated with Autism Spectrum Disorders (ASD) are over-represented among patients with Anorexia Nervosa (AN) as well as among relatives of these patients. Yet the co-occurrence of autistic traits in AN has not been fully explored and no previous study has directly compared self-reported evaluations of cognitive and socio-affective skills in AN and ASD. ...

Emotional difficulties in alexithymia and their social consequences have been linked to alterations in autonomic nervous system. However, most of previous studies did not take into account the distinction between the affective and the cognitive dimensions of the alexithymia, leading to inconsistent results. Aim: In this study, we compared the effects of both dimensions of alexithymia on the aut...

There are several known results asserting that undirected graphs can be partitioned in a way that satisfies various imposed constrains on the degrees. The corresponding results for directed graphs, where degrees are replaced by outdegrees, often fail, and when they do hold, they are usually much harder, and lead to fascinating open problems. In this note we list three problems of this type, and...

Studies examining the relationship between alexithymia and personality exclusively employed self-report measures of alexithymia. In the present study, we examined the relationship of both observerrated and self-reported alexithymia with the Big Five personality dimensions. We administered the Toronto Structured Interview for Alexithymia (TSIA) as an interview-based measure of alexithymia and, i...