Abstract
Computing the independence number of a graph remains NP-hard, even restricted to the class of triangle-free graphs. So the question arises, whether this remains valid if the minimum degree is required to be large. While in general graphs this problem remains NP-hard even within the class of graphs with minimum degree δ > (1 − e)n, the situation is different for triangle-free graphs. It will be shown that for triangle-free graphs with δ > n/3 the independence number can be computed as fast as matrix multiplication, while within the class of triangle-free graphs with δ > (1-e)n/4 the problem is already NP-hard.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
