Verwandte Artikel zu Topological Combinatorics: Combinatorial Topology,...

Topological Combinatorics: Combinatorial Topology, Topology, Algebraic Topology, Kneser Graph, Borsuk-Ulam Theorem, Computational Complexity Theory, Decision Tree - Softcover

 
9786130331900: Topological Combinatorics: Combinatorial Topology, Topology, Algebraic Topology, Kneser Graph, Borsuk-Ulam Theorem, Computational Complexity Theory, Decision Tree
Softcover
ISBN 10: 6130331908 ISBN 13: 9786130331900
Verlag: Betascript Publishers, 2010

Inhaltsangabe

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The discipline of combinatorial topology used combinatorial concepts in topology and in the early 20th century this gradually turned into the field of algebraic topology. In 1978 the situation was reversed when methods from algebraic topology were used to solve a problem in combinatorics when László Lovász proved the Kneser conjecture, thus beginning the new study of topological combinatorics. Lovász''s proof used the Borsuk-Ulam theorem and this theorem retains a prominent role in this new field. This theorem has many equivalent versions and analogs and has been used in the study of fair division problems. In another application of homological methods to graph theory Lovász proved both the undirected and directed versions of a conjecture of Frank.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The discipline of combinatorial topology used combinatorial concepts in topology and in the early 20th century this gradually turned into the field of algebraic topology. In 1978 the situation was reversed when methods from algebraic topology were used to solve a problem in combinatorics when László Lovász proved the Kneser conjecture, thus beginning the new study of topological combinatorics. Lovász''s proof used the Borsuk-Ulam theorem and this theorem retains a prominent role in this new field. This theorem has many equivalent versions and analogs and has been used in the study of fair division problems. In another application of homological methods to graph theory Lovász proved both the undirected and directed versions of a conjecture of Frank.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Betascript Publishers
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
6130331908
ISBN 13 
9786130331900
Einband
Tapa blanda
Anzahl der Seiten
112
Herausgeber
Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar