 | |
  | |
| Searching ... |
| 0 % | ||
Books by Jaroslav Nesetril
  | | An Invitation to Discrete Mathematics(2nd Edition) by Jiri Matousek, Jaroslav Nesetril, Jaroslav Neå¡EtåIl, Jaroslav Nes̆etřil Hardcover, 456 Pages, Published 2008 by Oxford University Press ISBN-13: 978-0-19-857043-1, ISBN: 0-19-857043-0 "This book is a clear and self-contained introduction to discrete mathematics. Aimed mainly at undergraduate and early graduate students of mathematics and computer science, it is written with the goal of stimulating interest in mathematics and an active, problem-solving approach to the presented material. The reader is led to an understanding of the basic principles and methods of actually doing mathematics (and having fun at that). Bei ..." |
 | | Graphs and Homomorphisms(1st Edition) (Oxford Lecture Series in Mathematics and Its Applications) by Pavol Hell, Jaroslav Nesetril, Jaroslav Nes̆etřil Hardcover, 256 Pages, Published 2004 by Oxford University Press ISBN-13: 978-0-19-852817-3, ISBN: 0-19-852817-5 "This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colourings, and has applications in complexity theory, artificial intelligence, telecommunication, and, most recently, statistical physics. B ..." |
 | | Mathematics of Ramsey Theory (Algorithms and Combinatorics) by Jaroslav Nesetril, Vojtech Rodl Hardcover, 269 Pages, Published 1991 by Springer-Verlag ISBN-13: 978-0-387-18191-2, ISBN: 0-387-18191-1 "One of the important areas of contemporary combinatorics is Ramsey theory. Ramsey theory is basically the study of structure preserved under partitions. The general philosophy is reflected by its interdisciplinary character. The ideas of Ramsey theory are shared by logicians, set theorists and combinatorists, and have been successfully applied in other branches of mathematics. The whole subject is quickly developing and has some new and ..." |
 | | A Unified Approach to Structural Limits and Limits of Graphs With Bounded Tree-depth (Memoirs of the American Mathematical Society) by Jaroslav Nesetril Paperback, 108 Pages, Published 2020 by Amer Mathematical Society ISBN-13: 978-1-4704-4065-7, ISBN: 1-4704-4065-2 "This limit object is a graph built on a standard probability space with the property that every first-order definable set of tuples is measurable. This is an example of the general concept of modeling the authors introduce here." |
 | | An Invitation to Discrete Mathematics(2nd Edition) by Jaroslav Nesetril, Jiri Matousek, Nesetril Matousek, Jirã Matousek Paperback, 464 Pages, Published 2008 by Oxford University Press ISBN-13: 978-0-19-857042-4, ISBN: 0-19-857042-2 "This second edition of Invitation to Discrete Mathematics is a clear and self-contained introduction to discrete mathematics. Aimed mainly at undergraduate and early graduate students of mathematics and computer science, it is written with the goal of stimulating interest in mathematics and an active, problem-solving approach to the presented material. The reader is led to an understanding of the basic principles and methods of actually ..." |
 | | Invitation to Discrete Mathematics by Jiri Matousek, Jaroslav Nesetril Paperback, 426 Pages, Published 1998 by Oxford University Press ISBN-13: 978-0-19-850207-4, ISBN: 0-19-850207-9 "This book is a clear and self-contained introduction to discrete mathematics, and in particular to combinatorics and graph theory. Aimed at undergraduate and early graduate students in mathematics and computer science, it is written with the goal of stimulating interest in mathematics and provides an active, problem-solving approach to the material. The reader is led to an understanding of the basic principles and methods of actually do ..." |
 | | Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity (Annals of Discrete Mathematics) by Jaroslav Nesetril, M. Fiedler, Miroslav Fiedler Hardcover, 410 Pages, Published 1992 by North-Holland ISBN-13: 978-0-444-89543-1, ISBN: 0-444-89543-4 "This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity. The conference on which this book is based was the fourth in a series which began in 1963, which was the first time specialists from East and West were able to come together. The 1990 meeting attracted 170 mathematicians and computer scientists from around the world, so this book represents an ..." |
 | | Invitation to Discrete Mathematics by Jiri Matousek, Jaroslav Nesetril, Ji閞鈏·Matou閟ek, Jaroslav Nes̆etřil Hardcover, 426 Pages, Published 1998 by Oxford University Press ISBN-13: 978-0-19-850208-1, ISBN: 0-19-850208-7 "This book is a clear and self-contained introduction to discrete mathematics, and in particular to combinatorics and graph theory. Aimed at undergraduates and early graduate students in mathematics and computer science, it is written with the goal of stimulating interest in mathematics and encourages an active, problem-solving approach to the material. The reader is led to an understanding of the basic principles and methods of actually ..." |
 | | Contemporary Trends in Discrete Mathematics(1st Edition) From Dimacs and Dimatia to the Future : Dimatia-Dimacs Conference, May 19-25, 1997, Stirin Castle, Czech ... MATHEMATICS AND THEORETICAL COMPUTER SCIENCE) by Jaroslav Nesetril, Jan Kratochvil, Ronald L. Graham, Fred S. Roberts, Dimacs Staff, Dimatia Staff, Ronald Lewis Graham, Amer Mathematical Society Hardcover, 389 Pages, Published 1999 by Amer Mathematical Society ISBN-13: 978-0-8218-0963-1, ISBN: 0-8218-0963-6 "Discrete mathematics stands among the leading disciplines of mathematics and theoretical computer science. This is due primarily to its increasing role in university curriculae and its growing importance in applications ranging from optimization to molecular biology. An inaugural conference was held cooperatively by DIMATIA and DIMACS to focus on the versatility, width, and depth of current progress in the subject area. This volume offe ..." |
 | | Invitation to Discrete Mathematics by Jiri Matousek, Jaroslav Nesetril Published 2008 ISBN-13: 978-1-281-86568-7, ISBN: 1-281-86568-0 |
 | | Graph Theory Construction and Dynamics by Jaroslav Nesetril Hardcover, 426 Pages, Published 2005 by John Wiley & Sons Inc ISBN-13: 978-0-471-09688-7, ISBN: 0-471-09688-1 |
 | | Invitation to Discrete Mathematics by Jiri Matousek, Jaroslav Nesetril Published 1998 ISBN-13: 978-1-280-81982-7, ISBN: 1-280-81982-0 |
 | | Graphs, Morphisms and Statistical Physics by Peter Winkler, Jaroslav Nesetril, Jaroslav Neeseteril Hardcover, 193 Pages, Published 2004 by Amer Mathematical Society ISBN-13: 978-0-8218-3551-7, ISBN: 0-8218-3551-3 "The intersection of combinatorics and statistical physics has experienced great activity in recent years. This flurry of activity has been fertilized by an exchange not only of techniques, but also of objectives. Computer scientists interested in approximation algorithms have helped statistical physicists and discrete mathematicians overcome language problems. They have found a wealth of common ground in probabilistic combinatorics. Clo ..." |
 | | Topological, Algebraical and Combinatorial Structures Frolik's Memorial Volume (Topics in Discrete Mathematics) by Jaroslav Nesetril Hardcover, 434 Pages, Published 1993 by North-Holland ISBN-13: 978-0-444-89236-2, ISBN: 0-444-89236-2 "With contributions from many researchers, this book is dedicated to the memory of Zdenek Frolik, the prominent Czechoslovakian mathematician who died in 1989 at the age of only 56 years. One of his achievements was the founding of the Winter School of Abstract Analysis, which transcended boundaries of individual fields of mathematics. This book pays tribute to Frolik's versatility and his belief that there is only one Mathematics." |
 | | Annals of Discrete Mathematics Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity Volume 51 by Miroslav Fiedler, J. Nešetril, Jaroslav Nesetril, J. Ne Etril Digital, 400 Pages, Published 1992 by North-Holland ISBN-13: 978-0-08-086791-5, ISBN: 0-08-086791-X "Every k-valent vertex is incident with k edges and thus kvp = ek, -i- XD ej,k. ... for all i, j, where i + j > 4g + 6. Therefore e" > (8g – 6)h/(12g -- 9) – 8(g – 1) > 2, because a graph without triangles must have at least 3(w(G) – 3) edges. Hence w (G) s 8, which is a contradiction to the assumption. Therefore w(G) s 4g + 5. [. ... Jaroslav Ivančo Katedra geometrie a algebry, PF UPJS Košice Poland Combinatorics, Graphs and Complex ..." |
 | | Sparsity Graphs, Structures, and Algorithms (Algorithms and Combinatorics) by Jaroslav Nesetril, Jaroslav Neå¡EtåIl Hardcover, 459 Pages, Published 2012 by Springer ISBN-13: 978-3-642-27874-7, ISBN: 3-642-27874-4 "This is the first book devoted to the systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is a typical example of a hard to define notion, the authors devised an unifying classification of general classes of structures. This approach is very robust and it has many remarkable properties. For example the classification is expressible in ..." |
 | | Diskrete Mathematik(2nd Edition) Eine Entdeckungsreise (Springer-Lehrbuch) (German Edition) by Jaroslav Nesetril, H. Mielke, Jiri Matousek Paperback, 488 Pages, Published 2011 by Springer ISBN-13: 978-3-540-30150-9, ISBN: 3-540-30150-X ""Dieses Buch ist [...] eine hervorragende Einführung in Kombinatorik und Graphentheorie für Studienanfänger ... das Buch ist wegen des ungewöhnlichen und sehr attraktiven Stiles der Darstellung bemerkenswert. [...] Die Sprachform ist vorwiegend die eines Gespräches mit dem Leser, ... Zum Beispiel werden bei einem Beweis zuerst die Grundidee oder die Zielsetzung genannt und erläutert, und auch im weiteren Verl ..." |
 | | Mathematics of Ramsey Theory(Reprint) (Algorithms and Combinatorics) by Jaroslav Nesetril, Vojtech Rödl, Vojtech R. Dl Paperback, 269 Pages, Published 2012 by Springer ISBN-13: 978-3-642-72907-2, ISBN: 3-642-72907-X "One of the important areas of contemporary combinatorics is Ramsey theory. Ramsey theory is basically the study of structure preserved under partitions. The general philosophy is reflected by its interdisciplinary character. The ideas of Ramsey theory are shared by logicians, set theorists and combinatorists, and have been successfully applied in other branches of mathematics. The whole subject is quickly developing and has some new and ..." |
 | | The Seventh European Conference on Combinatorics, Graph Theory and Applications EuroComb 2013 (Publications of the Scuola Normale Superiore / CRM Series) by Marco Pellegrini, Jaroslav Nesetril, Jaroslav Neå¡EtåIl Paperback, 600 Pages, Published 2013 by Edizioni Della Normale ISBN-13: 978-88-7642-474-8, ISBN: 88-7642-474-1 "In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague), EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), and Eurocomb'11 (Budapest), this volume covers recent advances in combinatorics and graph theory including applications in other areas of mathematics, computer science and engineering. Topics include, but are not limited to: Algebraic combinatorics, combinatorial geometry, combinatorial number theory, ..." |
 | | Mathematical and Engineering Methods in Computer Science 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, ... Papers (Lecture Notes in Computer Science) by Antonin Kucera, David Antos, Jaroslav Nesetril, Tomas Vojnar, Thomas A. Henzinger Paperback, 228 Pages, Published 2013 by Springer International Edition ISBN-13: 978-3-642-36044-2, ISBN: 3-642-36044-0 "This volume contains the post-proceedings of the 8th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2012, held in Znojmo, Czech Republic, in October, 2012. The 13 thoroughly revised papers were carefully selected out of 31 submissions and are presented together with 6 invited papers. The topics covered by the papers include: computer-aided analysis and verification, app ..." |
All Authors
All Bindings
All Editions
All Years
All Regions
Jaroslav Nesetril
All Bindings
All Editions
All Years
All Regions