Maximilian Hadek
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Combinatorics×1Complexity×1
Frequent co-authors
Research Timeline
2026
Cut-homotopies and the complexity of edge-coloring problems
The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulting in a P vs. NP-complete dichotomy.
Highlighted terms show continued research focus across papers