No abstract

Symptomatic of a contemporary concern with affective factors in cognitive processing, a corpus of research is now emerging on the role of interestingness in discourse processing. This research has concentrated on narrative prose and has adopted a structural approach, arguing for the centrality of event and discourse structure in producing an affect like interest. The authors point out that this approach considers only one type of interest—knowledge‐triggered—to the exclusion of another important type—value‐triggered. A more comprehensive understanding of interest will only be achieved by researching other genres, such as exposition, and by considering the multiple sources of interest‐producing conditions. We suggest the notion of “informational significance” as an inclusive term, and underline the need for a process‐based understanding of interest.

No abstract

No abstract

Meyniel's conjecture is one of the deepest open problems on the cop number of a graph. It states that for a connected graph G of order n, c(G) = O( √ n). While largely ignored for over 20 years, the conjecture is receiving increasing attention. We survey the origins of and recent developments towards the solution of the conjecture. We present some new results on Meyniel extremal families containing graphs of order n satisfying c(G) ≥ d √ n, where d is a constant.