Edge-colourings of graphs
by Wilson, Robin J., Fiorini, Stanley
fromResearch Notes in Mathematics
Relations between combinatorics and other parts of mathematics: [proceedings of the Symposium in Pure Mathematics…
by American Mathematical Society (Providence, R.I.), Ray-Chaudhuri, Dijen K., Symposium in Pure Mathematics of the American Mathematical Society, Columbus, Ohio
fromProceedings of symposia in pure mathematics
Pearls of Discrete Mathematics presents methods for solving counting problems and other types of problems that involve discrete structures. Through intriguing examples, problems, theorems, and proofs, the book illustrates the relationship of these structures to algebra, geometry…
Combinatorics is the theory of finite sets. A wide, amorphous, primordial subject matter. It was decided to emphasize the theory of simple general or homogeneous structures at the Symposia, and this volume collects the papers presented. With its numerous and varied open question…
Graph theory is a primary tool for detecting numerous hidden structures in various information networks, including Internet graphs, social networks, biological networks, or any graph representing relations in massive data sets. This book explains the universal and ubiquitous coh…
This book brings together - in an informal and tutorial fashion - the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields. Major concepts are illustrated with runnin…
Studies in foundations and combinatorics
The structural and algorithmic study of stability in nonexpansive networks is based on a representation of the possible assignments of Boolean values for a network as vertices in a Boolean hypercube under the associated Hamming metric. This global view takes advantage of the med…
The nine finite, planar, 3-connected, edge-transitive graphs have been known and studied for many centuries. The infinite, locally finite, planar, 3-connected, edge-transitive graphs can be classified according to the number of their end. The 1-ended graphs in this class were id…
A theory of counting nonintersecting lattice paths by the major index and its generalizations is developed. We obtain determinantal expressions for the corresponding generating functions for families of nonintersecting lattice paths with given starting points and given final poi…
Many sequences of combinatorial interest are known to be unimodal or log-concave and there has been a considerable amount of interest devoted to this topic. The main object of this work is to point out another branch of mathematics that can be successfully used to attack these k…