Local Conditions for Exponentially Many Subdivisions

@article{Liu2017LocalCF,
  title={Local Conditions for Exponentially Many Subdivisions},
  author={Hong Liu and Maryam Sharifzadeh and Katherine Staden},
  journal={Combinatorics, Probability & Computing},
  year={2017},
  volume={26},
  pages={423-430}
}
Given a graph F , let st(F ) be the number of subdivisions of F , each with a different vertex set, which one can guarantee in a graph G in which every edge lies in at least t copies of F . In 1990, Tuza asked for which graphs F and large t, one has that st(F ) is exponential in a power of t. We show that, somewhat surprisingly, the only such F are complete… CONTINUE READING