The poset of unlabeled induced subgraphs of a finite graph (Q2297242)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7169616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The poset of unlabeled induced subgraphs of a finite graph |
scientific article; zbMATH DE number 7169616 |
Statements
The poset of unlabeled induced subgraphs of a finite graph (English)
0 references
18 February 2020
0 references
For a finite graph, the set of unlabeled induced subgraphs can be ordered by \(H_1 \leq H_2 \) iff \(H_1 \) is an induced subgraph of \(H_2 \). This paper establishes a number of elementary results about this ordered set, including a way to, from this ordered set, recover the doubleton that consists of the clique number and the independence number of the graph.
0 references
finite graph
0 references
induced subgraph
0 references
0.7973576784133911
0 references
0.7704038023948669
0 references
0.7635416984558105
0 references
0.757281482219696
0 references
