Perfection thickness of graphs (Q1974539): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:25, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfection thickness of graphs |
scientific article |
Statements
Perfection thickness of graphs (English)
0 references
7 May 2000
0 references
For a graph \(G\), let \(f(G)\) be the least number of perfect subgraphs of \(G\) whose union is \(G\). Let \(f(n)= \max\{f(G):|V(G)|= n\}\). Improving results of Zs. Tuza, the authors prove that \[ \textstyle{{1\over 2}}(\log n-\log\log n- O(1))\leq f(n)\leq \lceil\log n\rceil, \] where \(\log\) denotes the base-2 logarithm.
0 references
thickness
0 references
perfect graphs
0 references
bipartite graphs
0 references
