108 research outputs found
Very Well-Covered Graphs with the Erd\"os-Ko-Rado Property
A family of independent -sets of a graph is an -star if every set
in the family contains some fixed vertex . A graph is -EKR if the maximum
size of an intersecting family of independent -sets is an -star. Holroyd
and Talbot conjecture that a graph is -EKR as long as , where is the minimum size of a maximal
independent set. It is suspected that the smallest counterexample to this
conjecture is a well-covered graph. Here we consider the class of very
well-covered graphs obtained by appending a single pendant edge to each
vertex of . We prove that the pendant complete graph is -EKR when
and strictly so when . Pendant path graphs are also
explored and the vertex whose -star is of maximum size is determined.Comment: 10 page
Relations between Financing and Output in the Not-for-Profit Hospital
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/68639/2/10.1177_107755878804500204.pd
Comparison of patient preferences for fecal immunochemical test or colonoscopy using the analytic hierarchy process
- âŠ