On n-partite tournaments with unique n-cycle

Communication assessment in real-life consultations is a complex task. Generic assessment instruments help but may also have disadvantages. The generic nature of the skills being assessed does not provide indications for context-specific behaviour required in practice situations; context influences are mostly taken into account implicitly. Our research questions are: 1. What factors do trained raters observe when rating workplace communication? 2. How do they take context factors into account when rating communication performance with a generic rating instrument? Nineteen general practitioners (GPs), trained in communication assessment with a generic rating instrument (the MAAS-Global), participated in a think-aloud protocol reflecting concurrent thought processes while assessing videotaped real-life consultations. They were subsequently interviewed to answer questions explicitly asking them to comment on the influence of predefined contextual factors on the assessment process. Results from both data sources were analysed. We used a grounded theory approach to untangle the influence of context factors on GP communication and on communication assessment. Both from the think-aloud procedure and from the interviews we identified various context factors influencing communication, which were categorised into doctor-related (17), patient-related (13), consultation-related (18), and education-related factors (18). Participants had different views and practices on how to incorporate context factors into the GP(-trainee) communication assessment. Raters acknowledge that context factors may affect communication in GP consultations, but struggle with how to take contextual influences into account when assessing communication performance in an educational context. To assess practice situations, raters need extra guidance on how to handle specific contextual factors

The Shifted Turan Sieve Method on Tournaments

This article has been published in a revised form in the Canadian Mathematical Bulletin http://dx.doi.org/10.4153/S000843951900016X. This version is free to view and download for private research and study only. Not for re-distribution, re-sale or use in derivative works. Copyright © Canadian Mathematical Society 2019.Abstract. We construct a shi ed version of the Turán sieve method developed by R. Murty and the second author and apply it to counting problems on tournaments. More precisely, we obtain upper bounds for the number of tournaments which contain a fixed number of restricted r-cycles. These are the first concrete results which count the number of cycles over “all tournaments”.Research partially supported by NSERC Discovery Grants || CAPES and CSF/CNPQ, Brazil

On n-partite tournaments with unique n-cycle

An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Proc. London Math. Soc. 21 (1970) 716-730, obtained a characterization of strongly connected tournaments with exactly one Hamilton cycle (i.e., n-cycle). For n ≥, we characterize strongly connected n-partite tournaments that are not tournaments with exactly one n-cycle. For n ≥ 5, we enumerate such non-isomorphic n-partite tournaments