50 years of Combinatorics, Graph Theory, and Computing

50 Years of Combinatorics, Graph Theory, and Computing advances research in discrete mathematics by providing current research surveys, each written by experts in their subjects. The book also celebrates outstanding mathematics from 50 years at the Southeastern International Conference on Combinatorics, Graph Theory & Computing (SEICCGTC). The conference is noted for the dissemination and stimulation of research, while fostering collaborations among mathematical scientists at all stages of their careers. The authors of the chapters highlight open questions. The sections of the book include: Combinatorics; Graph Theory; Combinatorial Matrix Theory; Designs, Geometry, Packing and Covering. Readers will discover the breadth and depth of the presentations at the SEICCGTC, as well as current research in combinatorics, graph theory and computer science. Features: Commemorates 50 years of the Southeastern International Conference on Combinatorics, Graph Theory & Computing with research surveys Surveys highlight open questions to inspire further research Chapters are written by experts in their fields Extensive bibliographies are provided at the end of each chapter Personal Reflections of the SEICCGTC: Origins and Beyond I: Combinatorics Some of My Favorite Problems Variations on the Sequenceable Theme Survey of Stack Sortable Permutations Dimensions for Posets and Chromatic Number for Graphs Edrős Magic II: Graph Theory Developments on Saturated Graphs Magic Labeling Basics Block Colorings of Graph Decompositions Reconfiguration of Colourings and Dominating Sets in Graphs Edge Intersection Graphs of Paths on a Grid III: Combinatorial Matrix Theory A Jaunt in Spectral Graph Theory Inverse Eigenvalue Problem of a Graph Rank Functions Permutation Matrices and Beyond: An Essay IV: Designs, Geometry, Packing and Covering Some New Families of 2-Resolutions Graphical Designs There Must be Fifty Ways to Miss a Cover Combinatorial Designs and Cryptography, Revisited A Survey of Scalar Multiplication Algorithms Arcs, Caps, Generalisations: Results and Problems Fan Chung received her PhD from University of Pennsylvania in 1974. She is a Distinguished Professor of Mathematics, Professor of Computer Science and Engineering, and the Paul Erdős Professor in Combinatorics at the University of California, San Diego. She has written three books, Spectral Graph Theory , Complex Graphs and Networks (with Lincoln Lu), and Erdős on Graphs (with Ron Graham) and almost 300 papers. S