Topics in Combinatorics and Graph Theory, Rainer Bodendiek; Rudolf Henn
Автор: Flajolet Название: Analytic Combinatorics ISBN: 0521898064 ISBN-13(EAN): 9780521898065 Издательство: Cambridge Academ Рейтинг: Цена: 13306.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The definitive treatment of analytic combinatorics. This self-contained text covers the mathematics underlying the analysis of discrete structures, with thorough treatment of a large number of applications. Exercises, examples, appendices and notes aid understanding: ideal for individual self-study or for advanced undergraduate or graduate courses.
Автор: Harris, John Hirst, Jeffry L. Mossinghoff, Michael Название: Combinatorics and graph theory ISBN: 0387797106 ISBN-13(EAN): 9780387797106 Издательство: Springer Рейтинг: Цена: 5723.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Covers a wide variety of topics in combinatorics and graph theory. This book includes results and problems that cross subdisciplines, emphasizing relationships between different areas of mathematics. It also includes sections in graph theory on distance, Eulerian trails, and hamiltonian paths.
Автор: Harris John M. Название: Combinatorics and Graph Theory ISBN: 1441927239 ISBN-13(EAN): 9781441927231 Издательство: Springer Цена: 5723.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: There are certain rules that one must abide by in order to create a successful sequel. -- Randy Meeks, from the trailer to Scream 2 While we may not follow the precise rules that Mr. Meeks had in mind for s- cessful sequels, we have made a number of changes to the text in this second edition. In the new edition, we continue to introduce new topics with concrete - amples, we provide complete proofs of almost every result, and we preserve the book'sfriendlystyle andlivelypresentation, interspersingthetextwith occasional jokes and quotations. The rst two chapters, on graph theory and combinatorics, remain largely independent, and may be covered in either order. Chapter 3, on in nite combinatorics and graphs, may also be studied independently, although many readers will want to investigate trees, matchings, and Ramsey theory for nite sets before exploring these topics for in nite sets in the third chapter. Like the rst edition, this text is aimed at upper-division undergraduate students in mathematics, though others will nd much of interest as well. It assumes only familiarity with basic proof techniques, and some experience with matrices and in nite series. The second edition offersmany additionaltopics for use in the classroom or for independentstudy. Chapter 1 includesa new sectioncoveringdistance andrelated notions in graphs, following an expanded introductory section. This new section also introduces the adjacency matrix of a graph, and describes its connection to important features of the graph.
Описание: Topics include, but are not limited to: Algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, ordered sets, random methods, topological combinatorics.
Описание: These are the proceedings of the conference "Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics" held at the Department of Mathematics, University of Florida, Gainesville, from November 11 to 13, 1999.
Автор: V. Bryant Название: Independence Theory in Combinatorics ISBN: 0412224305 ISBN-13(EAN): 9780412224300 Издательство: Springer Рейтинг: Цена: 12157.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Combinatorics may very loosely be described as that branch of mathematics which is concerned with the problems of arranging objects in accordance with various imposed constraints.
Описание: This IMA Volume in Mathematics and its Applications Applications of Combinatorics and Graph Theory to the Biological and Social Sciences is based on the proceedings of a workshop which was an integral part of the 1987-88 IMA program on APPLIED COMBINATORICS.
Автор: Martin Charles Golumbic; Irith Ben-Arroyo Hartman Название: Graph Theory, Combinatorics and Algorithms ISBN: 1441937234 ISBN-13(EAN): 9781441937230 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering.
Автор: Bolian Liu; Hong-Jian Lai Название: Matrices in Combinatorics and Graph Theory ISBN: 1441948341 ISBN-13(EAN): 9781441948342 Издательство: Springer Рейтинг: Цена: 23058.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Combinatorics and Matrix Theory have a symbiotic, or mutually beneficial, relationship. where an attempt was made to give a broad picture of the use of combinatorial ideas in matrix theory and the use of matrix theory in proving theorems which, at least on the surface, are combinatorial in nature.
Автор: S. B. Rao Название: Combinatorics and Graph Theory ISBN: 3540111514 ISBN-13(EAN): 9783540111511 Издательство: Springer Рейтинг: Цена: 6981.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Jin Akiyama; William Y.C. Chen; Mikio Kano; Xuelia Название: Discrete Geometry, Combinatorics and Graph Theory ISBN: 3540706658 ISBN-13(EAN): 9783540706656 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed post-proceedings of the 7th China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory, CJCDGCGT 2005, held in Tianjin, China, as well as in Xi`an, China, in November 2005. The 30 revised full papers address all current issues in discrete algorithmic geometry, combinatorics and graph theory.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
