Combinatorics Advances

ISBN-13: 9780792335740 / Angielski / Twarda / 1995 / 328 str.

Charles J. Colbourn; Ebdollah Sayed Mahmoodian; C. J. Colbourn

Opis

On March 28 31, 1994 (Farvardin 8 11, 1373 by Iranian calendar), the Twenty fifth Annual Iranian Mathematics Conference (AIMC25) was held at Sharif University of Technology in Tehran, Islamic Republic of Iran. Its sponsors in eluded the Iranian Mathematical Society, and the Department of Mathematical Sciences at Sharif University of Technology. Among the keynote speakers were Professor Dr. Andreas Dress and Professor Richard K. Guy. Their plenary lec tures on combinatorial themes were complemented by invited and contributed lectures in a Combinatorics Session. This book is a collection of refereed papers, submitted primarily by the participants after the conference. The topics covered are diverse, spanning a wide range of combinatorics and al lied areas in discrete mathematics. Perhaps the strength and variety of the pa pers here serve as the best indications that combinatorics is advancing quickly, and that the Iranian mathematics community contains very active contributors. We hope that you find the papers mathematically stimulating, and look forward to a long and productive growth of combinatorial mathematics in Iran."

Spis treści

Preface. 1. On a Conjecture of A. Hartman; S. Ajoodani-Namini, G. B. Khosrovshahi. 2. Some Problems in Total Graph Theory; M. Behzad. 3. Construction Techniques for Mutually Orthogonal Latin Squares; C. J. Colbourn. 4. The Spectrum of R-Orthogonal Latin Squares; C. J. Colbourn, L. Zhu. 5. General Theory of Translation Invariant Systems; A. Daneshgar. 6. Some Mathematical Problems Arising in Molecular Bioinformatics: The Concept of Bioinformatics; A. Dress. 7. An Algorithmic Approach to Tilings; A. Dress, et al. 8. A New Connection between Convex Geometry and Threshold Logic; M. R. Emamy-K. 9. The Unity of Combinatorics; R. K. Guy. 10. Unsolved Problems in Combinatorial Games; R. K. Guy. 11. (F,2)-Rotational Steiner Triple Systems; Z. Jiang. 12. A Simple Polynomial Time Algorithm for a Convex Hull Problem Equivalent to Linear Programming; B. Kalantari. 13. A Linear Time Algorithm for Minimum Cost Flow on Undirected One-Trees; B. Kalantari, I. Kalantari. 14. An Asymptotic Existence Result for Orthogonal Designs; H. Kharaghani. 15. Decomposition of Complete Tripartite Graphs into 5-Cycles; E. S. Mahmoodian, M. Mirzakhani. 16. The NSM of a Graph; D. Moazzami. 17. Zero-Knowledge Proofs for Independent Set and Dominating Set Problems; J. Mohajeri. 18. Exploring the Spectrum of Values of Permanents by Simulated Annealing; Y. Nourami. 19. Vector-Weighted Matchings; D. Schweigert. 20. Directed Quadruple Designs; N. Soltankhah. 21. Bounding Two-Terminal Network Reliability via Surface Duality; H. J. Strayer. 22. Defining Sets for Block Designs: An Update; A. Penfold Street. 23. Open Problems at the Combinatorics Workshop of AIMC25 (Tehran, 1994); E. S. Mahmoodian, M. A. Shokrollahi.