Clear, comprehensive introduction emphasizes graph imbedding but also covers thoroughly the connections between topological graph theory and other areas of mathematics.
Main Content
Mathematics
Combinatorial Methods with Computer Applications
Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the textbook in a combinatorial methods course or in a combined graph theory and combinatorics course.
Blog
Jonathan Gross retires after 47 years of teaching and research at Columbia
Jonathan Gross retires after 47 years of teaching and research at Columbia After 47 years of teaching and research at Columbia, Jonathan Gross retired last semester, following a highly active career that allowed him to indulge his lifelong love of …
Continue Reading about Jonathan Gross retires after 47 years of teaching and research at Columbia →
Top CS graduates awarded 2018 Jonathan Gross Prize
Source The Jonathan Gross Prize honors students who graduate at the top of their class with a track record of promising innovative contributions to computer science. Five graduating computer science students—one senior from each of the four …
Continue Reading about Top CS graduates awarded 2018 Jonathan Gross Prize →
Jonathan Gross Prize recognizes top CS graduates
Source The Jonathan Gross Prize is being awarded this year for the first time to honor students who graduate at the top of their class with a track record of promising innovative contributions to computer science. Five graduating computer science …
Continue Reading about Jonathan Gross Prize recognizes top CS graduates →