Stable sets versus independent sets (Q686148): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Boolean techniques for matroidal decomposition of independence systems and applications to graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3325492 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subgraphs and well‐quasi‐ordering / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matroids and the greedy algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-Completeness of Edge-Coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4111952 / rank | |||
Normal rank |
Latest revision as of 11:05, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Stable sets versus independent sets |
scientific article |
Statements
Stable sets versus independent sets (English)
0 references
10 March 1994
0 references
The matroidal number \(m(G)\) of a graph \(G\) is defined as the smallest integer \(m\) so that the collection of the stable sets of \(G\) arises as \(I_ 1\cup I_ 2 \cup \cdots \cup I_ m\) where the \(I_ i\) are collections of independent sets of matroids on the vertex set of \(G\). Computing \(m(G)\) is shown to be NP-hard and various results on graphs of matroidal number at most \(m\) are given. Similar problems with ``intersection'' rather than ``union'' are also considered.
0 references
matroidal number
0 references
stable sets
0 references
independent sets
0 references
matroids
0 references
NP-hard
0 references
0 references