Evasiveness of Graph Properties and Topological Fixed-Point Theorems provides the reader with an integrated treatment of the underlying proofs in the body of research around the use of topological methods to prove lower bounds on the complexity of graph properties.
Geometric combinatorics describes a wide area of mathematics that is primarily the study of geometric objects and their combinatorial structure. This text is a compilation of expository articles at the interface between combinatorics and geometry.
This book constitutes the proceedings of the Third International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2017, held in Goa, India, in February 2017. The 32 papers presented in this volume were carefully reviewed and selected from 103 submissions. They deal with the following areas: algorithms, graph theory, codes, polyhedral combinatorics, computational geometry, and discrete geometry.
This book constitutes the refereed proceedings of the 10th International Conference on Theory and Applications of Models of Computation, TAMC 2013, held in Hong Kong, China, in May 2013. The 31 revised full papers presented were carefully reviewed and selected from 70 submissions. Bringing together a wide range of researchers with interests in computational theory and applications, the papers address the three main themes of the conference which were computability, complexity, and algorithms and present current research in these fields with aspects to theoretical computer science, algorithmic mathematics, and applications to the physical sciences.
This undergraduate textbook in topological combinatorics covers such topics as fair division, graph coloring problems, evasiveness of graph properties, and embedding problems from discrete geometry. Includes many figures and exercises.
This collection of high-quality articles in the field of combinatorics, geometry, algebraic topology and theoretical computer science is a tribute to Jiří Matoušek, who passed away prematurely in March 2015. It is a collaborative effort by his colleagues and friends, who have paid particular attention to clarity of exposition – something Jirka would have approved of. The original research articles, surveys and expository articles, written by leading experts in their respective fields, map Jiří Matoušek’s numerous areas of mathematical interest.
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. 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.
To the uninitiated, algebraic topology might seem fiendishly complex, but its utility is beyond doubt. This brilliant exposition goes back to basics to explain how the subject has been used to further our understanding in some key areas. A number of important results in combinatorics, discrete geometry, and theoretical computer science have been proved using algebraic topology. While the results are quite famous, their proofs are not so widely understood. This book is the first textbook treatment of a significant part of these results. It focuses on so-called equivariant methods, based on the Borsuk-Ulam theorem and its generalizations. The topological tools are intentionally kept on a very elementary level. No prior knowledge of algebraic topology is assumed, only a background in undergraduate mathematics, and the required topological notions and results are gradually explained.
This volume is the first comprehensive treatment of combinatorial algebraic topology in book form. The first part of the book constitutes a swift walk through the main tools of algebraic topology. Readers - graduate students and working mathematicians alike - will probably find particularly useful the second part, which contains an in-depth discussion of the major research techniques of combinatorial algebraic topology. Although applications are sprinkled throughout the second part, they are principal focus of the third part, which is entirely devoted to developing the topological structure theory for graph homomorphisms.
This volume deals with the theory of finite topological spaces and its relationship with the homotopy and simple homotopy theory of polyhedra. The interaction between their intrinsic combinatorial and topological structures makes finite spaces a useful tool for studying problems in Topology, Algebra and Geometry from a new perspective. In particular, the methods developed in this manuscript are used to study Quillen's conjecture on the poset of p-subgroups of a finite group and the Andrews-Curtis conjecture on the 3-deformability of contractible two-dimensional complexes. This self-contained work constitutes the first detailed exposition on the algebraic topology of finite spaces. It is intended for topologists and combinatorialists, but it is also recommended for advanced undergraduate students and graduate students with a modest knowledge of Algebraic Topology.