Our search has the following Google-type functionality:

If you use '+' at the start of a word, that word will be present in the search results.

*eg. Harry +Potter*

*Search results will contain 'Potter'.*

If you use '-' at the start of a word, that word will be absent in the search results.

*eg. Harry -Potter*

*Search results will not contain 'Potter'.*

If you use 'AND' between 2 words, then both those words will be present in the search results.

*eg. Harry AND Potter*

*Search results will contain both 'Harry' and 'Potter'.*

NOTE: AND will only work with single words not phrases.

If you use 'OR' between 2 single words, then either or both of those words will be present in the search results.

*eg. 'Harry OR Potter'*

*Search results will contain just 'Harry', or just 'Potter', or both 'Harry' and 'Potter'.*

NOTE: OR will only work with single words not phrases.

If you use 'NOT' before a word, that word will be absent in the search results. (This is the same as using the minus symbol).

*eg. 'Harry NOT Potter'*

*Search results will not contain 'Potter'.*

NOTE: NOT will only work with single words not phrases.

If you use double quotation marks around words, those words will be present in that order.

*eg. "Harry Potter"*

*Search results will contain 'Harry Potter', but not 'Potter Harry'.*

NOTE: "" cannot be combined with AND, OR & NOT searches.

If you use '*' in a word, it performs a wildcard search, as it signifies any number of characters. (Searches cannot start with a wildcard).

*eg. 'Pot*er'*

*Search results will contain words starting with 'Pot' and ending in 'er', such as 'Potter'.*

- Sort Results By

The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the... [more]

An in-depth coverage of selected areas of graph theory, focusing on symmetry properties of graphs. This second edition expands... [more]

A self-contained and concise introduction to recent developments, particularly those of a geometric and topological nature,... [more]

Fixed Point Theory and Graph Theory provides an intersection between the theories of fixed point theorems that give the conditions... [more]

A self-contained and concise introduction to recent developments, particularly those of a geometric and topological nature,... [more]

This book introduces combinatorial analysis to the beginning student. The author begins with the theory of permutation and... [more]

This two-volume work covers the main known equivalents to the Riemann hypothesis. Classical and modern arithmetic statements... [more]

This survey volume looks at developing trends in combinatorics with applications in the study of words and in symbolic dynamics.... [more]

Reissued in the Oxford Classical Texts, this acclaimed second edition is nowadays the key resource on Macdonald polynomials,... [more]

This book offers a unique treatment of agent-based models. Through the introduction of the two families of models, namely,... [more]

Written for advanced undergraduate and beginning graduate students, this book provides a wide range of examples along with... [more]

The Erdos-Ko-Rado Theorem is a fundamental result in combinatorics. Aimed at graduate students and researchers, this comprehensive... [more]

Combining the features of a textbook with those of a problem workbook, this text presents a natural, friendly way to learn... [more]

Written for mathematicians working with the theory of graph spectra, this book explores more than 400 inequalities for eigenvalues... [more]

This book covers random graphs from the basic to the advanced and will appeal to anyone interested in combinatorics, applied... [more]

A Librarian's Guide to Graphs, Data and the Semantic Web is geared toward... [more]

One of the latest mathematical discoveries was the proof, by Andrew Wiles, of Fermat's last theorum, a 300-year old conjecture... [more]

For students and researchers interested in algebraic combinatorics, this book not only provides an introduction to the geometries... [more]

This book consists of nine survey papers by internationally renowned mathematicians. It will be of interest to researchers... [more]

Commutation Relations, Normal Ordering, and Stirling Numbers provides an introduction to the combinatorial aspects of normal... [more]

Hailed by The Mathematical Gazette as an extremely valuable addition to the literature of algebraic topology, this concise... [more]

Catalan numbers are probably the most ubiquitous sequence of numbers in mathematics. This book gives some basic background... [more]

For students and researchers interested in algebraic combinatorics, this book not only provides an introduction to the geometries... [more]

Combinatorics is the branch of discrete mathematics that studies (and counts) permutations, combinations, and arrangements... [more]

Network theory is a major topic of interdisciplinary research which covers diverse areas including physics, mathematics and... [more]