The subject of transplant immunosuppression has generated significant interest in recent years. Excellent immunosuppression, advances in surgical technique, post-transplantation care, and infection control have resulted in excellent outcomes. There is widespread support for the notion that the fundamental objective in transplant immunology should be the achievement of specific graft toleran...

This short paper surveys recent results on the generation of implicitly given hypergraphs, as well as their applications in data mining, reliability theory, integer programming and combinatorics. More precisely, we consider a monotone property π over the subsets of a finite set V , the corresponding family Sπ of subsets satisfying property π, and the problem of generating (sequentially) the fam...

We propose a systematic methodology for defining tournament solutions as extensions of maximality. The central concepts of this methodology are maximal qualified subsets and minimal stable sets. We thus obtain an infinite hierarchy of tournament solutions, encompassing the top cycle, the uncovered set, the Banks set, the minimal covering set, and the tournament equilibrium set. Moreover, the hi...

We investigate subsets of the symmetric group with structure similar to that of a graph. The “trees” of these subsets then lead to minimal highly symmetric generating sets of the symmetric group. We show that there exist generating sets among these with edge-transitive Cayley graphs and investigate them in relation to the Lovasz conjecture.

AIM To characterise infiltrating T cells in kidneys and circulating lymphocyte subsets of adult patients with primary/idiopathic minimal change disease. METHODS In a cohort of 9 adult patients with primary/idiopathic minimal change recruited consecutively at disease onset, we characterized (1) infiltrating immune cells in the kidneys using immunohistochemistry and (2) circulating lymphocyte s...

Similarly to Maximum Satisfiability (MaxSAT), Minimum Satisfiability (MinSAT) is an optimization extension of the Boolean Satisfiability (SAT) decision problem. In recent years, both problems have been studied in terms of exact and approximation algorithms. In addition, the MaxSAT problem has been characterized in terms of Maximal Satisfiable Subsets (MSSes) and Minimal Correction Subsets (MCSe...