Skip to main content

An invariant of link concordance

  • Conference paper
  • First Online:
Topology Conference

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 375))

  • 346 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. R. H. Fox, A quick trip through knot theory, Topology of Three-Manifolds and Related Topics, M. K. Fort, editor, Prentice-Hall, (1962), 120–161.

    Google Scholar 

  2. L. Kauffman, Link Manifolds (to appear).

    Google Scholar 

  3. R. Robertello, An invariant of knot cobordism, Comm. Pure and Appl. Math. 18 (1965), 543–555.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Raymond F. Dickman Jr. Peter Fletcher

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verleg

About this paper

Cite this paper

Kauffman, L.H. (1974). An invariant of link concordance. In: Dickman, R.F., Fletcher, P. (eds) Topology Conference. Lecture Notes in Mathematics, vol 375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0064022

Download citation

  • DOI: https://doi.org/10.1007/BFb0064022

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06684-2

  • Online ISBN: 978-3-540-37948-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics