1Department of Psychology, Zlotowski Center for Neuroscience, Ben-Gurion University of the Negev, Beer-Sheva, Israel 2Department of Cognitive Sciences, Ben-Gurion University of the Negev, Beer-Sheva, Israel 3Department of Computer Sciences, Ben-Gurion University of the Negev, Beer-Sheva, Israel 4Department of Learning Disabilities and Edmond J. Safra Brain Research Center for the Study of Learn...

Mitrani Department of Desert Ecology, Jacob Blaustein Institutes for Desert Research, Ben-Gurion University of the Negev, Desert Animal Adaptations and Husbandry, Wyler Department of Dryland Agriculture, Jacob Blaustein Institutes for Desert Research, Ben-Gurion University of the Negev, Midreshet Ben-Gurion, Israel, Department of Ecology and Environment Conservation, Omsk State Pedagogical Univ...

We show that the norm graph constructed in [13] with n vertices about 1 2n 2−1/t edges, which contains no copy of Kt,(t−1)!+1, does not contain a copy of Kt+1,(t−1)!−1.

In this paper we investigate the closure ~-* under substitution-composition of a family of graphs ~,, defined by a set Lr of forbidden configurations. We first prove that ~-* can be defined by a set L~* of forbidden subgraphs. Next, using a counterexample we show that ~* is not necessarily a finite set, even when .~ is finite. We then give a sufficient condition for ~* to be finite and a simple...

Logical structures for modeling agents’ reasoning about unawareness are presented where it can hold simultaneously that: (i) agents’ beliefs about whether they are fully aware need not be veracious with partitional information; and (ii) the agent is fully aware if and only if she is aware of a fixed domain of formulae. In light of (ii), all states are deemed “possible”. Semantics operate in two...

We characterise t-perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane triangulation is h-perfect if and only if it is perfect.

A circle graph is the intersection graph of a family of chords on a circle. There is no known characterization of circle graphs by forbidden induced subgraphs that do not involve the notions of local equivalence or pivoting operations. We characterize circle graphs by a list of minimal forbidden induced subgraphs when the graph belongs to one of the following classes: linear domino graphs, P4-t...

In this note, we prove that all 2× 2 monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations. This follows from a slightly more general result about certain 2× 2 having two monotone cells in the same row.

Balkan endemic nephropathy (BEN) was described in 1957, and this review gives an account of research forty years later. The etiology remains the main unanswered problem in BEN despite broad investigations conducted into the possible role of genetic factors, environmental agents and immune mechanisms.The evidence accumulated so far indicates that BEN is an environmentally-induced disease. A cont...

Pôle d’Anesthésie Réanimation et Urgences, Hôpital Militaire Moulay Ismaïl-Meknès, Faculté de Médecine et de Pharmacie de Fès, Université Sidi Mohamed Ben Abdellah, Fès, Maroc, Service Oto-Rhino Laryngologie, Hôpital Militaire Moulay Ismaïl-Meknès, Faculté de Médecine et de Pharmacie de Fès, Université Sidi Mohamed Ben Abdellah, Fès, Maroc, Service de Chirurgie Maxillo Faciale, Hôpital Militair...