Skip to main content

Appendix on representability

  • Chapter
Independence Theory in Combinatorics

Abstract

The status of this chapter is a little different from that of the preceding ones and we draw attention to this by referring to it as an appendix. Whereas in Chapters 1 to 4 all results stated were also proved, here we find it desirable to include some results without proof. In spite of this, we still only touch upon the fringe of the representation problem.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1980 V. Bryant and H. Perfect

About this chapter

Cite this chapter

Bryant, V., Perfect, H. (1980). Appendix on representability. In: Independence Theory in Combinatorics. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-5900-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-5900-2_5

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-0-412-22430-0

  • Online ISBN: 978-94-009-5900-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics