Search Results

We study two extremal problems about subgraphs excluding a family $\mathcal{F}$ of graphs: (i) Among all graphs with $m$ edges, what is the smallest size $f(m,\mathcal{F})$ of a largest $\mathcal{F}$-free subgraph? (ii) Among all graphs with minimum degree $\...

The 2011 ITiCSE working group on information assurance (IA) education examined undergraduate curricula at the two- and four-year levels, both within and outside the United States (US). A broad set of two-year IA degree programs were examined in order to ...

This paper discusses subcomparatives with 'incommensurable' adjectives (e.g. beautiful and intelligent), which have received little attention in the literature so far. This is surprising, as the topic is of great importance for the current discussion ...

The interval degree semantics for clausal (CP)-comparatives given in [5] is shown to be equivalent to a point degree semantics in which the CPexternal degree relation is interpreted internal to the CP.

Heim [9] notes certain restrictions on quantifier intervention in comparatives and proposes an LF-constraint to account for this. I show that these restrictions are identical to constraints on intervention in wh-questions widely discussed under the ...

Important examples of @P"1^0 classes of functions f@__ __@w@w are the classes of sets (elements of 2@w) which separate a given pair of disjoint r.e. sets: S"2(A"0,A"1):={f@__ __2@w:(@__ __i<2)(@__ __x@__ __A"i)f(x)<>i}. A wider class consists of the ...

Bollobás and Thomason showed that every 22k-connected graph is k-linked. Their result used a dense graph minor. In this paper, we investigate the ties between small graph minors and linkages. In particular, we show that a 6-connected graph with a K ₉^- ...

Among all simple graphs on n vertices and e edges, which ones have the largest sum of squares of the vertex degrees? It is easy to see that they must be threshold graphs, but not every threshold graph is optimal in this sense. Boesch et al. [Boesch et al., ...