On the ultimate independence ratio of a graph

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

Geňa Hahn, Pavol Hell, Svatopluk Poljak

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 number; chromatic number; graph homomorphism; fractional chromatic numbers; ultimate independence ratio

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C15: Coloring of graphs and hypergraphs

Related Items

Graphically abelian groups, Fractional multiples of graphs and the density of vertex-transitive graphs, Independence ratios of graph powers, 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, On the bounds for the ultimate independence ratio of a graph, Asymptotic values of the Hall-ratio for graph powers, Star chromatic numbers and products of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 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