This paper considers the following question: What is the maximum number of k-cliques in an n-vertex graph with no Kt-minor? This question generalises the extremal function for Kt-minors, which corresponds to the k = 2 case. The exact answer is given for t 6 9 and all values of k. We also determine the maximum total number of cliques in an n-vertex graph with no Kt-minor for t 6 9. Several obser...

It is well known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalize the notion of the relative end degree, which had been previously introduced by the first author for locally finite graphs, and show that large minimum relative degree at the ends and large mi...

Since 1955 at least forty articles on geriatric anaesthesia and associated problems have appeared in the literature. Fifteen of these have been written in English and the others in European languages, mostly German and Italian. Fourteen of the fifteen English articles have originated from North America. To the best of the writer's knowledge this leaves Bedford's (1955) contribution as one of th...

A theoretical investigation is performed of the complexes of a tetracationic porphyrin, tetra-(4-N-methylpyridyl)-porphyrin, (T4MPyP), with the hexanucleotides d(CGCGCG)2 and d(TATATA)2, considering the possibility of both the intercalative and the groove binding interactions. These computations demonstrate that T4MPyP manifests a significant preference for intercalation in its complex with d(C...

Let IF be field, and let A and B be n X n matrices with elements in IF. Suppose that A is completely reducible and that B is symmetric. If the principal minors of A determined by the 1and 2-circuits of the graph of B and by the chordless circuits of the graph of A are equal to the corresponding principal minors of B, then A is diagonally similar to B; and conversely.

Path-addition is an operation that takes a graph and adds an internally vertex-disjoint path between two vertices together with a set of supplementary edges. Path-additions are just the opposite of taking minors. We show that some classes of graphs are closed under path-addition, including non-planar, right angle crossing, fan-crossing free, quasi-planar, (aligned) bar 1-visibility, and interva...

WOPR-domain proteins are found throughout the fungal kingdom where they function as master regulators of cell morphology and pathogenesis. Genetic and biochemical experiments previously demonstrated that these proteins bind to specific DNA sequences and thereby regulate transcription. However, their primary sequence showed no relationship to any known DNA-binding domain, and the basis for their...

We present here for the first time the crystal structure of an AT-hook domain. We show the structure of an AT-hook of the ubiquitous nuclear protein HMGA1, combined with the oligonucleotide d(CGAATTAATTCG)(2), which has two potential AATT interacting groups. Interaction with only one of them is found. The structure presents analogies and significant differences with previous NMR studies: the AT...