We are interested in a wide range of theoretical and applied problems. On one hand we continue tradition-al directions of the Hungarian School (Ramsey Theory, Graph Coloring, Extremal Graph Theory) where we collaborate with many outstanding researchers of the area, including Paul Erdős, with whom we have joint-ly published fifteen papers. On the other hand we work in several areas of structural and algorithmic Graph and Hypergraph Theory (Networks, Graph Distances, On-line colorings, Hypergraph Transversals, Helly structures, Interval systems).

Combinatrial Information Theory

Our main direction here continues the approach initiated by Rényi, to consider combinatorial problems com-ing from Communication Theory, Search Theory. In particular, in the last few years we concentrated on appli-cations of hypergraph theoretic methods for optimal code constructions and achieved several results, many with co-authors (Ahlswede, Alon, Füredi, Tardos). A few results In the last few years the following results were obtained by the members of our group. Füredi and Ruszinkó improved the best known bounds on the rate of Euclidean Superimposed Codes. They also managed to extend those results - using a basic theorem of Millman - to arbitrary metric spaces.

Brochure

Discrete Structures Research Group