A Survey of Combinatorial Theory
eBook - PDF

A Survey of Combinatorial Theory

  1. 476 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

A Survey of Combinatorial Theory

About this book

A Survey of Combinatorial Theory covers the papers presented at the International Symposium on Combinatorial Mathematics and its Applications, held at Colorado State University (CSU), Fort Collins, Colorado on September 9-11, 1971. The book focuses on the principles, operations, and approaches involved in combinatorial theory, including the Bose-Nelson sorting problem, Golay code, and Galois geometries. The selection first ponders on classical and modern topics in finite geometrical structures; balanced hypergraphs and applications to graph theory; and strongly regular graph derived from the perfect ternary Golay code. Discussions focus on perfect ternary Golay code, finite projective and affine planes, Galois geometries, and other geometric structures. The book then examines the characterization problems of combinatorial graph theory, line-minimal graphs with cyclic group, circle geometry in higher dimensions, and Cayley diagrams and regular complex polygons. The text discusses combinatorial problems in finite Abelian groups, dissection graphs of planar point sets, combinatorial problems and results in fractional replication, Bose-Nelson sorting problem, and some combinatorial aspects of coding theory. The text also reviews the enumerative theory of planar maps, balanced arrays and orthogonal arrays, existence of resolvable block designs, and combinatorial problems in communication networks. The selection is a valuable source of information for mathematicians and researchers interested in the combinatorial theory.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access A Survey of Combinatorial Theory by Jagdish N. Srivastava in PDF and/or ePUB format, as well as other popular books in Mathematics & Science & Technology Biographies. We have over one million books available in our catalogue for you to explore.

Table of contents

  1. Front Cover
  2. A Survey of Combinatorial Theory
  3. Copyright Page
  4. Table of Contents
  5. Dedication
  6. Preface
  7. List of Publications by R. C. Bose
  8. CHAPTER 1. Some Classical and Modern Topics in Finite Geometrical Structures
  9. CHAPTER 2. Balanced Hypergraphs and Some Applications to Graph Theory
  10. CHAPTER 3. A Strongly Regular Graph Derived from the Perfect Ternary Golay Code
  11. CHAPTER 4. Characterization Problems of Combinatorial Graph Theory
  12. CHAPTER 5. Line-minimal Graphs with Cyclic Group
  13. CHAPTER 6. Circle Geometry in Higher Dimensions
  14. CHAPTER 7. Bose as Teacher—The Early Years
  15. CHAPTER 8. Construction of Symmetric Hadamard Matrices
  16. CHAPTER 9. Cayley Diagrams and Regular Complex Polygons
  17. CHAPTER 10. Combinatorial Problems in Finite Abelian Groups
  18. CHAPTER 11. A q-Analog of the Partition Lattice
  19. CHAPTER 12. Problems and Results on Combinatorial Number Theory
  20. CHAPTER 13. Dissection Graphs of Planar Point Sets
  21. CHAPTER 14. Some Combinatorial Problems and Results in Fractional Replication
  22. CHAPTER 15. The Bose-Nelson Sorting Problem
  23. CHAPTER 16. Nombres d'Euler et Permutations Alternantes
  24. CHAPTER 17. Some Combinatorial Aspects of Coding Theory
  25. CHAPTER 18. Some Augmentations of Bose-Chaudhuri Error Correcting Codes
  26. CHAPTER 19. On Order Statistics and Some Applications of Combinatorial Methods in Statistics
  27. CHAPTER 20. Construction of Block Designst
  28. CHAPTER 21. A Survey of Graphical Enumeration Problems
  29. CHAPTER 22. On Spectrally Bounded Graphs
  30. CHAPTER 23. Combinatorial Search Problems
  31. CHAPTER 24. Some Problems in Combinatorial Geometry
  32. CHAPTER 25. Recent Developments in India in the Construction of Confounded Asymmetrical Factorial Designs
  33. CHAPTER 26. Combinatorial Problems in Communication Networks
  34. CHAPTER 27. On Hadamard Difference Sets
  35. CHAPTER 28. On the Randomization of Block Designs
  36. CHAPTER 29. Some Combinatorial Problems of Arrays and Applications to Design of Experimentst
  37. CHAPTER 30. The Existence of Resolvable Block Designs
  38. CHAPTER 31. Variants of (v, k, λ)-Designs
  39. CHAPTER 32. Coding Need: A System's Concept
  40. CHAPTER 33. On the Problem of Construction and Uniqueness of Saturated Designs
  41. CHAPTER 34. Strongly Regular Graphs and Symmetric 3-Designs
  42. CHAPTER 35. Balanced Arrays and Orthogonal Arrays
  43. CHAPTER 36. On Software Validation
  44. CHAPTER 37. The Enumerative Theory of Planar Maps
  45. CHAPTER 38. A Construction for Room Squares
  46. Author Index