The average size of an independent set in graphs with a given chromatic number (Q1081615): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:07, 5 March 2024

scientific article
Language Label Description Also known as
English
The average size of an independent set in graphs with a given chromatic number
scientific article

    Statements

    The average size of an independent set in graphs with a given chromatic number (English)
    0 references
    1988
    0 references
    Let G be a graph on n vertices, let \(\chi\) (G) denote its chromatic number, and let \(\alpha\) (G) denote the average size of an independent set of verties of G. A simple argument shows that \(\alpha (G)=\Omega (n/\chi (G)\log \chi (G))\). Here we show that this is sharp by constructing, for every \(\chi\leq O(n/\log n)\) a graph G with \(\chi (G)=\chi\) and with \(\alpha (G)=\Theta (n/\chi \log \chi)\). This settles a problem of Linial and Saks.
    0 references
    graph
    0 references
    chromatic number
    0 references
    independent set
    0 references
    0 references

    Identifiers