Showing math.COShow all
2 papers · 1 filter
math.CO2026
Cut-homotopies and the complexity of edge-coloring problems
Alexey Barsukov, Roman Feller, Maximilian Hadek +1
We study the computational complexity of problems that ask if a given graph admits an edge-coloring that does not contain an edge-colored clique from some fixed finite family. We s…
math.CO2025
KÅnig = Ramsey, A compactness lemma for Ramsey categories
Maximilian Hadek
We prove a new characterization of the Ramsey property of categories in terms of a generalized form of KÅnig's tree lemma. Afterwards, we discuss its applications to structural Ra…