Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Alexander S. Kulikov

Alexander S. Kulikov

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Complexity×1

Frequent co-authors

Grigorii Braulov1×
Nikolai Chukhin1×
Ivan Mihajlin1×

Research Timeline

2026
Complexity of the Graph Homomorphism Problem w.r.t. Degeneracy

This paper studies the complexity of the graph homomorphism problem in terms of the degeneracy of the target graph and shows that under ETH, there is no efficient algorithm for this problem.

Highlighted terms show continued research focus across papers

Papers

cs.CCTheoreticalRecentJul 10, 2026

Complexity of the Graph Homomorphism Problem w.r.t. Degeneracy

Grigorii Braulov, Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin

This paper studies the complexity of the graph homomorphism problem in terms of the degeneracy of the target graph and shows that under ETH, there is no efficient algorithm for this problem.

View →