In this paper, we explore the effects of certain forbidden substructure conditions on preordered sets. In particular, we characterize in terms of these conditions those preordered sets which can be represented as the supremum of a well-ordered ascending chain of lowersets whose members are constructed by means of alternating applications of disjoint union and ordinal sums with chains. These dec...

Biosurfactants can be classified by their chemical composition and their origin. This review briefly describes various classes of biosurfactants based on their origin and introduces a few of the most widely used biosurfactants. The current status and future trends in biosurfactant production are discussed, with an emphasis on those derived from plants. Following a brief introduction of the prop...

The graph theoretic problem of identifying the finite sets C of constraint graphs for which there is a countable universal C-free graph is closely related to the problem of determining for which sets C the model companion T ∗ C of the theory of C-free graphs is א0-categorical, and this leads back to combinatorics. Little is known about these theories from any other perspective, such as stabilit...

The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs has remained an open question for a long time. The minimal strongly imperfect graphs which are simultaneous imperfect are only odd holes and odd antiholes ( E. Olaru, [9]), but the entire list is not known, in spite of a lot of particular results in this direction. In this paper we give some new ...

Let L3 be the class of edge intersection graphs of linear 3-uniform hypergraphs. The problem of recognizing G ∈ L3 is NP-complete. Denote by δALG the minimal integer such that the problem ”G ∈ L3 ” is polynomially solvable in the class of graphs G with the minimal vertex degree δ(G) ≥ δALG and by δFIS the minimal integer such that L3 can be characterized by a finite list of forbidden induced su...

Antibody use is ubiquitous in the biomedical sciences. However, determining best research practices has not been trivial. Many commercially available antibodies and antibody-conjugates are poorly characterized and lack proper validation. Uncritical application of such useless tools has contributed to the reproducibility crisis in biomedical research. Despite early initiatives such as MIAPAR or ...

Graph class C is induced-hereditary if for every graph G in C, every induced subgraph of G belongs to C. Induced-hereditary graph classes allow characterisation by sets of forbidden induced subgraphs. Such characterisations are very useful for automatic deduction of relations between graph classes. However, sometimes those sets of forbidden induced subgraphs are infinite, what makes it difficul...

Silver nanoparticles (AgNPs) show different physical and chemical properties compared to their macroscale analogs. This is primarily due to their small size and, consequently, the exceptional surface area of these materials. Presently, advances in the synthesis, stabilization, and production of AgNPs have fostered a new generation of commercial products and intensified scientific investigation ...

Daligault, Rao and Thomassé asked whether a hereditary class of graphs well-quasi-ordered by the induced subgraph relation has bounded clique-width. Lozin, Razgon and Zamaraev recently showed that this is not true for classes defined by infinitely many forbidden induced subgraphs. However, in the case of finitely many forbidden induced subgraphs the question remains open and we conjecture that ...

In this article, we present a characterization of basic graphs in terms of forbidden induced subgraphs. This class of graphs was introduced by Conforti, Cornuéjols and Vušković [3], and it plays an essential role in the announced proof of the Strong Perfect Graph Conjecture by Chudnovsky, Robertson, Seymour and Thomas [2]. Then we apply the Reducing Pseudopath Method [13] to characterize the su...