maximum independent set

providers: ISGCI

Definition: Is the cardinality of a maximum vertex set such that no pair of vertices in the set are connected by an edge.

Relations

Other		Relation from	Relation to
acyclic chromatic number	blue■	exclusion	exclusion
arboricity	blue■	exclusion	exclusion
average degree	blue■	exclusion	exclusion
average distance	red■	exclusion	upper bound
bandwidth	blue■	exclusion	exclusion
bipartite	blue■	unbounded	exclusion
bipartite number	red■	exclusion	upper bound
bisection bandwidth	blue■	exclusion	exclusion
block	blue■	unbounded	exclusion
book thickness	blue■	exclusion	exclusion
boolean width	blue■	exclusion	exclusion
bounded components	blue■	exclusion	exclusion
boxicity	blue■	exclusion	exclusion
branch width	blue■	exclusion	exclusion
c-closure	blue■	exclusion	exclusion
carving-width	blue■	exclusion	exclusion
chordal	blue■	unbounded	exclusion
chordality	blue■	exclusion	exclusion
chromatic number	blue■	exclusion	exclusion
clique cover number	green■	upper bound	exclusion
clique-tree-width	blue■	exclusion	exclusion
clique-width	blue■	exclusion	exclusion
cluster	blue■	unbounded	exclusion
co-cluster	blue■	unbounded	exclusion
cograph	blue■	unbounded	exclusion
complete	green■	upper bound	exclusion
connected	blue■	unbounded	exclusion
contraction complexity	blue■	exclusion	exclusion
cutwidth	blue■	exclusion	exclusion
cycle	blue■	unbounded	exclusion
cycles	blue■	unbounded	exclusion
d-path-free	blue■	exclusion	exclusion
degeneracy	blue■	exclusion	exclusion
degree treewidth	blue■	exclusion	exclusion
diameter	red■	exclusion	upper bound
diameter+max degree	blue■	exclusion	exclusion
disconnected	cyan■	unknown to HOPS	exclusion
disjoint cycles	blue■	unbounded	exclusion
distance to bipartite	blue■	exclusion	exclusion
distance to block	blue■	exclusion	exclusion
distance to bounded components	blue■	exclusion	exclusion
distance to chordal	blue■	exclusion	exclusion
distance to cluster	blue■	exclusion	exclusion
distance to co-cluster	blue■	exclusion	exclusion
distance to cograph	blue■	exclusion	exclusion
distance to complete	green■	upper bound	exclusion
distance to disconnected	blue■	exclusion	exclusion
distance to edgeless	blue■	exclusion	exclusion
distance to forest	blue■	exclusion	exclusion
distance to interval	blue■	exclusion	exclusion
distance to linear forest	blue■	exclusion	exclusion
distance to maximum degree	blue■	exclusion	exclusion
distance to outerplanar	blue■	exclusion	exclusion
distance to perfect	blue■	exclusion	exclusion
distance to planar	blue■	exclusion	exclusion
distance to stars	blue■	exclusion	exclusion
domatic number	blue■	exclusion	exclusion
domination number	red■	exclusion	upper bound
edge clique cover number	blue■	exclusion	exclusion
edge connectivity	blue■	exclusion	exclusion
edgeless	blue■	unbounded	exclusion
feedback edge set	blue■	exclusion	exclusion
feedback vertex set	blue■	exclusion	exclusion
forest	blue■	unbounded	exclusion
genus	blue■	exclusion	exclusion
girth	red■	exclusion	upper bound
grid	blue■	unbounded	exclusion
h-index	blue■	exclusion	exclusion
inf-flip-width	blue■	exclusion	exclusion
interval	blue■	unbounded	exclusion
iterated type partitions	blue■	exclusion	exclusion
linear clique-width	blue■	exclusion	exclusion
linear forest	blue■	unbounded	exclusion
linear NLC-width	blue■	exclusion	exclusion
linear rank-width	blue■	exclusion	exclusion
maximum clique	blue■	exclusion	exclusion
maximum degree	blue■	exclusion	exclusion
maximum independent set	yellow■	equal	equal
maximum induced matching	red■	exclusion	upper bound
maximum leaf number	blue■	exclusion	exclusion
maximum matching	blue■	exclusion	exclusion
maximum matching on bipartite graphs	blue■	exclusion	exclusion
mim-width	magenta■	exclusion	unknown to HOPS
minimum degree	blue■	exclusion	exclusion
mm-width	blue■	exclusion	exclusion
modular-width	blue■	exclusion	exclusion
module-width	blue■	exclusion	exclusion
neighborhood diversity	blue■	exclusion	exclusion
NLC-width	blue■	exclusion	exclusion
NLCT-width	blue■	exclusion	exclusion
odd cycle transversal	blue■	exclusion	exclusion
outerplanar	blue■	unbounded	exclusion
path	blue■	unbounded	exclusion
pathwidth	blue■	exclusion	exclusion
pathwidth+maxdegree	blue■	exclusion	exclusion
perfect	blue■	unbounded	exclusion
planar	blue■	unbounded	exclusion
radius-r flip-width	magenta■	exclusion	unknown to HOPS
rank-width	blue■	exclusion	exclusion
shrub-depth	blue■	exclusion	exclusion
sim-width	magenta■	exclusion	unknown to HOPS
size	green■	upper bound	exclusion
star	cyan■	unknown to HOPS	exclusion
stars	blue■	unbounded	exclusion
topological bandwidth	blue■	exclusion	exclusion
tree	blue■	unbounded	exclusion
tree-independence number	magenta■	exclusion	unknown to HOPS
treedepth	blue■	exclusion	exclusion
treelength	red■	exclusion	upper bound
treewidth	blue■	exclusion	exclusion
twin-cover number	blue■	exclusion	exclusion
twin-width	blue■	exclusion	exclusion
vertex connectivity	blue■	exclusion	exclusion
vertex cover	blue■	exclusion	exclusion
vertex integrity	blue■	exclusion	exclusion

Results

2019 The Graph Parameter Hierarchy by Sorge
- page 11 : clique cover number upper bounds maximum independent set by a linear function – Lemma 4.26. The minimum clique cover number $c$ strictly upper bounds the independence number $\alpha$.
1988 The average distanceisnot morethan the independence number by Chung
- maximum independent set upper bounds average distance by a linear function – [ed. paraphrased from another source] Let $G$ be a graph. Then $\bar{D} \le \alpha$, with equality holding if and only if $G$ is complete.
unknown source
- maximum independent set upper bounds domination number by a linear function – Every maximal independent set is also a dominating set because any undominated vertex could be added to the independent set.
- maximum independent set upper bounds maximum induced matching by a linear function – Each edge of the induced matching can host at one vertex of the independent set.
- bounded maximum independent set does not imply bounded clique cover number
- bounded domination number does not imply bounded maximum independent set
assumed
- maximum independent set upper bounds bipartite number by a linear function – folklore
- maximum independent set is equivalent to maximum independent set – assumed