Title Ramsey Theorems for Knots, Links and Spatial Graphs

@inproceedings{Negami2010TitleRT,
  title={Title Ramsey Theorems for Knots, Links and Spatial Graphs},
  author={Seiya Negami},
  year={2010}
}
An embedding f: G —► R of a graph G into R is said to be linear if each edge f(e) (e G E(G)) is a straight line segment. It will be shown that for any knot or link type k , there is a finite number R(k) such that every linear embedding of the complete graph Kn with at least R(k) vertices (n > R(k)) in R contains a knot or link equivalent to k . 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

On a spatial analogue of Kuratowski's theorem on planar graphs—«2« open problem, Graph Theory, Lagów 1981

  • H. Sachs
  • Proceedings, Lecture Notes in Math.,
  • 1983

Ramsey theory

  • R. L. Graham, B. L. Rothschild, J. H. Spencer
  • Wiley
  • 1980

Embedding of graphs in E

  • A. F. Brown
  • Ph.D. Desertation, Kent State Univ.
  • 1977
2 Excerpts

Knots and links

  • D. Rolfsen
  • Math. Lecture Series 7, Publish or Perish
  • 1976
2 Excerpts

Cooperative classes of finite sets in one and more dimensions

  • T. H. Motzkin
  • J. Combin. Theory
  • 1967

Fáry, On straight line representation of planar graphs

  • I. Fa
  • Acta Sei. Math. (Szeged)
  • 1948

Motzkin , Cooperative classes of finite sets in one and more dimensions

  • H. T.
  • J . Combin . Theory

Similar Papers

Loading similar papers…