Now showing items 1-1 of 1

    • 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 ...