Minimal imperfect graphs: A simple approach (Q1924490): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphical properties related to minimal imperfection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On certain polytopes associated with graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5609153 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A characterization of perfect graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Perfect zero–one matrices / rank | |||
Normal rank | |||
Latest revision as of 14:18, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimal imperfect graphs: A simple approach |
scientific article |
Statements
Minimal imperfect graphs: A simple approach (English)
0 references
11 March 1997
0 references
For a graph \(G\), let \(\omega(G)\) denote the cardinality of a maximum clique of \(G\), and \(\alpha(G)\) the cardinality of a maximum independent set. \textit{L. Lovász} [J. Comb. Theory, Ser. B 13, 95-98 (1972; Zbl 0241.05107)] showed that a graph \(G\) is perfect iff \(|H|\leq \omega(H)\alpha(H)\) for every induced subgraph \(H\) of \(G\). This paper provides a short proof of this theorem, and discusses its consequences.
0 references
perfect graphs
0 references
clique
0 references
independent set
0 references
