Abstract

The question of existence and classification of combinatorial objects with certain properties is a central problem in combinatorics. In most cases, computer search seems to be the sole approach to tackle the problem. In the last decades, improvements in the existing algorithms and the appearance of new methods along with the advent of new generations of powerful computing resources have resulted in numerous computational achievements. In this talk, we review some of these methods for the construction and classification of combinatorial objects such as regular graphs, block designs and Hadamard matrices.



Information: