Let G be a graph G whose largest independent set has size m. A permutation π of m {1, …, } is an independent
Let G be a graph G whose largest independent set has size m. A permutation π of {1, . . . , m} is an independent set permutation of G ifwhere a k (G) is the number of independent sets of size k in G. In 1987 Alavi, Malde, Schwenk and Erdős proved that every permutation of {1, . . . , m} is an independent set permutation of some graph. They raised the question of determining, for each m, the smallest number f (m) such that every permutation of {1, . . . , m} is an independent set permutation of some graph with at most f (m) vertices, and they gave an upper bound on f (m) of roughly m 2m . Here we settle the question, determining f (m) = m m .Alavi et al. also considered matching permutations, defined analogously to independent set permutations. They observed that not every permutation is a matching permutation of some graph, putting an upper bound of 2 m−1 on the number of matching permutations of {1, . . . , m}. Confirming their speculation that this upper bound is not tight, we improve it to O(2 m / √ m).We also consider an extension of independent set permutations to weak orders, and extend Alavi et al.'s main result to show that every weak order on {1, . . . , m} can be realized by the independent set sequence of some graph with largest independent set size m, and with at most m m+2 vertices.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.