Combinatorics Advances

1. Front Matter

   Pages i-xv

   PDF

2. On a Conjecture of A. Hartman

   • S. Ajoodani-Namini, G. B. Khosrovshahi

   Pages 1-12

3. Some Problems in Total Graph Theory

   • M. Behzad

   Pages 13-26

4. Construction Techniques for Mutually Orthogonal Latin Squares

   • Charles J. Colbourn

   Pages 27-48

5. The Spectrum of R-Orthogonal Latin Squares

   • Charles J. Colbourn, L. Zhu

   Pages 49-75

6. General Theory of Translation Invariant Systems

   • Amir Daneshgar

   Pages 77-89

7. Some Mathematical Problems Arising in Molecular Bioinformatics: The Concept of Bioinformatics

   • Andreas Dress

   Pages 91-109

8. An Algorithmic Approach to Tilings

   • A. Dress, O. Delgado Friedrichs, D. Huson

   Pages 111-119

9. A New Connection Between Convex Geometry and Threshold Logic

   • M. R. Emamy-K.

   Pages 121-128

10. The Unity of Combinatorics

    • Richard K. Guy

    Pages 129-159

11. Unsolved Problems in Combinatorial Games

    • Richard K. Guy

    Pages 161-179

12. (F, 2)—Rotational Steiner Triple Systems

    • Zhike Jiang

    Pages 181-206

13. A Simple Polynomial Time Algorithm for a Convex Hull Problem Equivalent to Linear Programming

    • Bahman Kalantari

    Pages 207-216

14. A Linear-Time Algorithm for Minimum Cost Flow on Undirected One-Trees

    • Bahman Kalantari, Iraj Kalantari

    Pages 217-223

15. An Asymptotic Existence Result for Orthogonal Designs

    • Hadi Kharaghani

    Pages 225-233

16. Decomposition of Complete Tripartite Graphs Into 5-Cycles

    • E. S. Mahmoodian, Maryam Mirzakhani

    Pages 235-241

17. The NSM of a Graph

    • Dara Moazzami

    Pages 243-250

18. Zero-Knowledge Proofs for Independent Set and Dominating Set Problems

    • Javad Mohajeri

    Pages 251-254

19. Exploring the Spectrum of Values of Permanents by Simulated Annealing

    • Yaghout Nourani

    Pages 255-265

20. Vector-Weighted Matchings

    • Dietmar Schweigert

    Pages 267-276

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.

• algorithms
• bioinformatics
• combinatorics
• discrete mathematics
• geometry
• graph theory
• latin square
• Matching
• Matchings
• Mathematica
• mathematics
• polynomial
• programming

• University of Waterloo, Canada

  Charles J. Colbourn

• Sharif University of Technology, Tehran, Iran

  Ebadollah S. Mahmoodian

Policies and ethics