Abstract
The general framework for the linear algebra method in combinatorics is the following: if we want to come up with an upper bound on the size of a set of objects, associate them with elements in a vector space V of relatively low dimension, and show that these elements are linearly independent; hence, we cannot have more objects in our set than the dimension of V.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jukna, S. (2011). The Basic Method. In: Extremal Combinatorics. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17364-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-17364-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17363-9
Online ISBN: 978-3-642-17364-6
eBook Packages: Computer ScienceComputer Science (R0)