Simplicial Complexes of Graphs
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial comp...
Gardado en:
| Autor Principal: | |
|---|---|
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Edición: | 1st ed. 2008. |
| Series: | Lecture Notes in Mathematics
1928 |
| Sujets: | |
| Acceso en liña: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
L'impression du document génère 369 p. Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Simplicial complexes of graphs, Jakob Jonsson, 2008, Berlin, Springer, 1 vol. (XIV-378 p.), Lecture Notes in Mathematics, 978-3-540-75858-7 |
Table des matières:
- and Basic Concepts and Overview Abstract Graphs and Set Systems Simplicial Topology Tools Discrete Morse Theory Decision Trees Miscellaneous Results Overview of Graph Complexes Graph Properties Dihedral Graph Properties Digraph Properties Main Goals and Proof Techniques Vertex Degree Matchings Graphs of Bounded Degree Cycles and Crossings Forests and Matroids Bipartite Graphs Directed Variants of Forests and Bipartite Graphs Noncrossing Graphs Non-Hamiltonian Graphs Connectivity Disconnected Graphs Not 2-connected Graphs Not 3-connected Graphs and Beyond Dihedral Variants of k-connected Graphs Directed Variants of Connected Graphs Not 2-edge-connected Graphs Cliques and Stable Sets Graphs Avoiding k-matchings t-colorable Graphs Graphs and Hypergraphs with Bounded Covering Number Open Problems Open Problems