Abstract
Abstract For a hereditary class X, the number X n of n-vertex graphs in X (also known as the speed of X) satisfies lim n → ∞ log 2 X n ( n 2 ) = 1 − 1 k ( X ) where k ( X ) is a natural number called the index of the class. Each class X of index k > 1 can be approximated by a minimal class of the same index. In this paper, we use Ramsey theory to show that the maximum independent set problem is fixed-parameter tractable in all minimal classes of index k for all values of k.
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.
