5,315 research outputs found

    Proof of Koml\'os's conjecture on Hamiltonian subsets

    Get PDF
    Koml\'os conjectured in 1981 that among all graphs with minimum degree at least dd, the complete graph Kd+1K_{d+1} minimises the number of Hamiltonian subsets, where a subset of vertices is Hamiltonian if it contains a spanning cycle. We prove this conjecture when dd is sufficiently large. In fact we prove a stronger result: for large dd, any graph GG with average degree at least dd contains almost twice as many Hamiltonian subsets as Kd+1K_{d+1}, unless GG is isomorphic to Kd+1K_{d+1} or a certain other graph which we specify.Comment: 33 pages, to appear in Proceedings of the London Mathematical Societ

    Colorectal Cancer Brochure Development for African Americans

    Full text link
    Introduction: African Americans are more likely to die from colorectal cancer (CRC) than any other racial/ethnic group in the United States. Unfortunately, African Americans are also less likely to undergo screening for CRC than their White counterparts. Focus groups methodology was used to refine educational brochures designed to increase CRC screening among African Americans. Methods: Two series of focus groups were completed, with a total of seven groups and 39 participants. Six different brochures (stage-matched and culturally sensitive) designed to promote CRC screening among African Americans were evaluated. Results: All participants thought that the brochures motivated them to talk with their health care providers about screening. Cost, pain, medical mistrust and fear were identified as major barriers and the brochures were modified to address these concerns. Conclusions: Focus groups methodology with African Americans can be used to inform brochures designed to increase African Americans CRC screening that addresses their major concerns

    A relative of Hadwiger's conjecture

    Full text link
    Hadwiger's conjecture asserts that if a simple graph GG has no Kt+1K_{t+1} minor, then its vertex set V(G)V(G) can be partitioned into tt stable sets. This is still open, but we prove under the same hypotheses that V(G)V(G) can be partitioned into tt sets X1,
,XtX_1,\ldots, X_t, such that for 1≀i≀t1\le i\le t, the subgraph induced on XiX_i has maximum degree at most a function of tt. This is sharp, in that the conclusion becomes false if we ask for a partition into t−1t-1 sets with the same property.Comment: 6 page

    Primitives Merging for Rapid 3D Modeling

    Get PDF
    • 

    corecore