The Ultimate Categorical Independence Ratio of a Graph

DOI10.1137/S0895480194276909MaRDI QIDQ4881293zbMATH OpenFDO

Authors Douglas F. Rall, Jason I. Brown, R. J. Nowakowski

Publication date 6 October 1996

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

decompositionindependence numbercategorical productultimate categorical independence ratio

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Recommendations

• On the ultimate categorical independence ratio
• The Ultimate Categorical Independence Ratio of Complete Multipartite Graphs
• Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio
• On maximum independent set of categorical product and ultimate categorical ratios of graphs
• On the ultimate independence ratio of a graph

Cited in

(9)

• A note on the ultimate categorical matching in a graph
• On maximum independent set of categorical product and ultimate categorical ratios of graphs
• Asymptotic values of the Hall-ratio for graph powers
• On the ultimate categorical independence ratio
• Measure preserving homomorphisms and independent sets in tensor graph powers
• Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio
• On the ultimate independence ratio of a graph
• On independent domination in direct products
• The Ultimate Categorical Independence Ratio of Complete Multipartite Graphs

This page was built for publication: The Ultimate Categorical Independence Ratio of a Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4881293)