• On the Erdos-Sos conjecture and the Cayley Isomorphism Problem 

      Balasubramanian, Suman (Mississippi State UniversityDepartment of Mathematics and Statistics.College of Arts and Sciences, 7/10/2009)
      We study the Erdős- Sòs conjecture that states that ever graph of average degree greater than k-1 contains every tree of order k+1. While the conjecture was studied for some graphs, it still remains open and of interest ...