On the ultimate independence ratio of a graph

DOI10.1016/0195-6698(95)90030-6zbMath0829.05026OpenAlexW1979898269MaRDI QIDQ1893949

Svatopluk Poljak, Geňa Hahn, Pavol Hell

Publication date: 7 January 1996

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0195-6698(95)90030-6

zbMATH Keywords

independence numberchromatic numbergraph homomorphismfractional chromatic numbersultimate independence ratio

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items (14)

\(k\)-tuple chromatic number of the Cartesian product of graphs ⋮ A fixed box theorem for the cartesian product of graphs and metric spaces ⋮ On the ultimate normalized chromatic difference sequence of a graph ⋮ Star-extremal graphs and the lexicographic product ⋮ Star chromatic numbers and products of graphs ⋮ On the bounds for the ultimate independence ratio of a graph ⋮ Asymptotic values of the Hall-ratio for graph powers ⋮ Shifts of the stable Kneser graphs and hom-idempotence ⋮ \(k\)-tuple colorings of the Cartesian product of graphs ⋮ Graphically abelian groups ⋮ Coloring graphs by translates in the circle ⋮ Fractional multiples of graphs and the density of vertex-transitive graphs ⋮ On maximum independent set of categorical product and ultimate categorical ratios of graphs ⋮ Independence ratios of graph powers

Cites Work

• The chromatic difference sequence of the Cartesian product of graphs
• Homomorphisms of 3-chromatic graphs
• The chromatic difference sequence of a graph
• Independence ratios of graph powers
• On the bounds for the ultimate independence ratio of a graph
• Analogues of the Shannon Capacity of a Graph
• On the Shannon capacity of a graph
• On a Problem of C. E. Shannon in Graph Theory
• Unnamed Item
• Unnamed Item

This page was built for publication: On the ultimate independence ratio of a graph