• Contact

  • Newsletter

  • About us

  • Delivery options

  • News

  • 0
    50 years of Combinatorics, Graph Theory, and Computing

    50 years of Combinatorics, Graph Theory, and Computing by Chung, Fan; Graham, Ron; Hoffman, Frederick;

    Series: Discrete Mathematics and Its Applications;

      • GET 10% OFF

      • The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
      • Publisher's listprice GBP 55.99
      • The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.

        28 336 Ft (26 987 Ft + 5% VAT)
      • Discount 10% (cc. 2 834 Ft off)
      • Discounted price 25 503 Ft (24 288 Ft + 5% VAT)

    28 336 Ft

    db

    Availability

    Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
    Not in stock at Prospero.

    Why don't you give exact delivery time?

    Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.

    Product details:

    • Edition number 1
    • Publisher Chapman and Hall
    • Date of Publication 14 October 2024

    • ISBN 9781032919843
    • Binding Paperback
    • No. of pages442 pages
    • Size 234x156 mm
    • Weight 820 g
    • Language English
    • Illustrations 40 Illustrations, black & white
    • 764

    Categories

    Short description:

    The book is a collection of research surveys in discrete mathematics written by leading experts.The sections of the book include: Extremal graphtheory and random graphs; Graph coloring and structural graph theory; Algorithms; Designs, Geometry, Packing and Covering; Combinatorial matrix theory;Cryptology and coding theory, Enumeration.

    More

    Long description:

    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

    More

    Table of Contents:

    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

    Edros 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

    More