The poset of unlabeled induced subgraphs of a finite graph (Q2297242): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The poset on connected induced subgraphs of a graph need not be Sperner / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4383890 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some theorems on graphs and posets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5754498 / rank | |||
Normal rank | |||
Latest revision as of 20:30, 21 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The poset of unlabeled induced subgraphs of a finite graph |
scientific article |
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
