General Information
Project DescriptionsWe are working on some open problems in graph theory and combinatorics. I participate in three projects. Dominating Sets on Colored TournamentsIt is known that for one and two colors there is always a single dominator on a transitively colored tournament. We want to estimate an upper bound of the size of the dominating set depending only on the number of colors and not on the size of the graph. Weekly LogWeek 1:
Week 2:
Week 3:
Week 4:
Week 5:
