For the complexes introduced in the three preceding chapters, there are five parameters that we are particularly interested in:(1)homology, (2)homotopy type, (3)depth, (4)connectivity degree, and (5)Euler characteristic.In some cases, our analysis leads to more specific information about the complexes such as a large vertex-decomposable skeleton or an optimal decision tree.Still, our focus remains on the five listed parameters.
Keywords
- Simplicial Complex
- Euler Characteristic
- Homotopy Type
- Proof Technique
- Graph Property
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Main Goals and Proof Techniques. In: Simplicial Complexes of Graphs. Lecture Notes in Mathematics, vol 1928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75859-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-75859-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75858-7
Online ISBN: 978-3-540-75859-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)
