Abstract
We show that for several pattern graphs on four vertices (e.g., \(C_4\)), their induced copies in host graphs with n vertices and no clique on \(k+1\) vertices can be deterministically detected in time \(\tilde{O}(n^{\omega }k^{\mu }+n^2k^2),\) where \(\tilde{O}(f)\) stands for \(O(f (\log f)^c )\) for some constant c, and \(\mu \approx 0.46530\). The aforementioned pattern graphs have a pair of non-adjacent vertices whose neighborhoods are equal. By considering dual graphs, in the same asymptotic time, we can also detect four vertex pattern graphs, that have an adjacent pair of vertices with the same neighbors among the remaining vertices (e.g., \(K_4\)), in host graphs with n vertices and no independent set on \(k+1\) vertices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.