Raphael Yuster
Has grant
Research Interests
Make your next move.
Prepare your application
Review drafts before you send them.
Explore related searches
Recent Grants
Grant: Close
Problems in Extremal Graph Theory
Open Date: 2016-01-01
Close Date: 2019-12-31
Articles (8)
Year:
2026
Year:
2026
Year:
2026
Year:
2025
Since counting subgraphs in general graphs is, by and large, a computationally demanding problem, it is natural to try and design fast algorithms for restricted families of graphs. One such family that has been extensively studied is that of graphs of bounded degeneracy (e.g., planar graphs). This line of work, which started in the early 80’s, culminated in a recent work of Gishboliner et al., which highlighted the importance of the task of counting homomorphic copies of cycles (i.e., cyclic walks) in graphs of bounded degeneracy. Our main result in this paper is a surprisingly tight relation between the above task and the well-studied problem of detecting (standard) copies of directed cycles in general directed graphs. More precisely, we prove the following: One can compute the number of homomorphic copies of C 2k and C 2k+1 in n -vertex graphs of bounded degeneracy in time Õ( n d k ), where the fastest known algorithm for detecting directed copies of C k in general m -edge digraphs runs in time Õ( m d k ). Conversely, one can transform any O(n b k ) algorithm for computing the number of homomorphic copies of C 2k or of C 2k+1 in n -vertex graphs of bounded degeneracy, into an Õ( m b k ) time algorithm for detecting directed copies of C k in general m -edge digraphs. We emphasize that our first result does not use a bl
Year:
2023
Year:
2022
Year:
2021
Year:
2020
Make your next move.
Prepare your application
Review drafts before you send them.