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...
সংরক্ষণ করুন:
| প্রধান লেখক: | |
|---|---|
| বিন্যাস: | Livre numérique |
| ভাষা: | Anglais |
| প্রকাশিত: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| সংস্করন: | 1st ed. 2008. |
| মালা: | Lecture Notes in Mathematics
1928 |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| টীকা: |
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 |
| LEADER | 03937nam a22004457a 4500 | ||
|---|---|---|---|
| 001 | 940185 | ||
| 008 | 080505q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN123739950 | ||
| 020 | |a 9783540758594 | ||
| 041 | 0 | |a eng | |
| 082 | |a 511.6 | ||
| 082 | |a 510 | ||
| 084 | |a 05E25. 2000 | ||
| 084 | |a 55U10. 2000 | ||
| 084 | |a 06A11. 2000 | ||
| 100 | 1 | |a Jonsson, Jakob, |d 1972- | |
| 245 | 1 | 0 | |a Simplicial Complexes of Graphs |c Jakob Jonsson. |
| 250 | |a 1st ed. 2008. | ||
| 260 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 1 | |a Lecture Notes in Mathematics |v 1928 |x 1617-9692 | |
| 500 | |a L'impression du document génère 369 p. | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 504 | |a Bibliogr. Index | ||
| 505 | 1 | |a 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 | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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 complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes | ||
| 650 | |a Théorie des graphes | ||
| 650 | |a Mathématiques | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Topologie algébrique | ||
| 776 | 0 | |0 119759160 |t Simplicial complexes of graphs |f Jakob Jonsson |d 2008 |c Berlin |n Springer |p 1 vol. (XIV-378 p.) |s Lecture Notes in Mathematics |z 978-3-540-75858-7 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-3-540-75859-4 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-34D67BNL-2 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:74786361X |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/978-3-540-75859-4 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750881194 |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/978-3-540-75859-4 |z Accès INSA CVL | |
| 997 | |0 940185 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||