Independence ratios of graph powers (Q1322230): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Homomorphisms of 3-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the star chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ultimate independence ratio of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic difference sequence of the Cartesian product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bounds for the ultimate independence ratio of a graph / rank
 
Normal rank

Revision as of 14:32, 22 May 2024

scientific article
Language Label Description Also known as
English
Independence ratios of graph powers
scientific article

    Statements

    Independence ratios of graph powers (English)
    0 references
    0 references
    0 references
    0 references
    5 May 1994
    0 references
    Consider the limiting behaviour of the independence ratio of increasing cartesian powers of a graph. The authors observe that the limit always exists, and illustrate several situations in which the limit can be evaluated.
    0 references
    independence number
    0 references
    chromatic number
    0 references
    cartesian product
    0 references
    independence ratio
    0 references
    cartesian powers
    0 references
    limit
    0 references

    Identifiers