Now showing items 1-2 of 2

    • Counting substructures I: Color critical graphs 

      Mubayi, Dhruv (Elsevier, 2010-12-01)
      Let F be a graph which contains an edge whose deletion reduces its chromatic number. We prove tight bounds on the number of copies of F in a graph with a prescribed number of vertices and edges. Our results extend those ...
    • Penalized Cluster Analysis With Applications to Family Data 

      Fang, Yixin; Wang, Junhui (Elsevier, 2011-06-01)
      Cluster analysis is the assignment of observations into clusters so that observations in the same cluster are similar in some sense, and many clustering methods have been developed. However, these methods cannot be applied ...