Stephen H. Hechler

Learn More
Define a simple graph G to be k-superuniversal iff for any k-element simple graph K and for any full subgraph H of K every full embedding of H into G can be extended to a full embedding of K into G. We prove that for each positive integer k there exist finite k-superuniversal graphs, and e find upper and looer bounds on the smallest such graphs. We also(More)
  • 1