دانلود کتاب Combinatorics Advances

فهرست مطالب :

Front Matter....Pages i-xv
On a Conjecture of A. Hartman....Pages 1-12
Some Problems in Total Graph Theory....Pages 13-26
Construction Techniques for Mutually Orthogonal Latin Squares....Pages 27-48
The Spectrum of R -Orthogonal Latin Squares....Pages 49-75
General Theory of Translation Invariant Systems....Pages 77-89
Some Mathematical Problems Arising in Molecular Bioinformatics: The Concept of Bioinformatics....Pages 91-109
An Algorithmic Approach to Tilings....Pages 111-119
A New Connection Between Convex Geometry and Threshold Logic....Pages 121-128
The Unity of Combinatorics....Pages 129-159
Unsolved Problems in Combinatorial Games....Pages 161-179
( F , 2)—Rotational Steiner Triple Systems....Pages 181-206
A Simple Polynomial Time Algorithm for a Convex Hull Problem Equivalent to Linear Programming....Pages 207-216
A Linear-Time Algorithm for Minimum Cost Flow on Undirected One-Trees....Pages 217-223
An Asymptotic Existence Result for Orthogonal Designs....Pages 225-233
Decomposition of Complete Tripartite Graphs Into 5-Cycles....Pages 235-241
The NSM of a Graph....Pages 243-250
Zero-Knowledge Proofs for Independent Set and Dominating Set Problems....Pages 251-254
Exploring the Spectrum of Values of Permanents by Simulated Annealing....Pages 255-265
Vector-Weighted Matchings....Pages 267-276
Directed Quadruple Designs....Pages 277-291
Bounding Two-Terminal Network Reliability via Surface Duality....Pages 293-306
Defining Sets for Block Designs: An Update....Pages 307-320
Open Problems at the Combinatorics Workshop of Aimc25 (Tehran, 1994)....Pages 322-324
Back Matter....Pages 325-328