De som köpt den här boken har ofta också köpt Big Cloud av Camille Seaman (inbunden).
Köp båda 2 för 844 krI början av 1800-talet kämpade bödelsfamiljen Åkerman för att överleva i det svenska samhällets utkant. Under ledning av familjefadern Peter, vars yrke som skarprättare inte var det mest aktade men nödvändigt för familjens överlevnad, möter de båd...
From the reviews: "The subject of this book is the topology of graph complexes. A graph complex is a family of graphs which is closed under deletion of edges. Topological and enumerative properties of monotone graph properties such as matchings, forests, bipartite graphs, non-Hamiltonian graphs, not-k-connected graphs are discussed. Researchers, who find any of the stated problems intriguing, will be enticed to read the book." (Herman J. Servatius, Zentralblatt MATH, Vol. 1152, 2009)
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.