Independence number of products of Kneser graphs

DOI10.1016/j.disc.2018.12.017zbMath1405.05150OpenAlexW2906680278WikidataQ128652612 ScholiaQ128652612MaRDI QIDQ1727773

Mario Valencia-Pabon, Boštjan Brešar

Publication date: 20 February 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.12.017

zbMATH Keywords

independence numberCartesian productKneser graphgraph product2-independence number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Clique number of Xor products of Kneser graphs ⋮ The Maximum k-Colorable Subgraph Problem and Related Problems ⋮ Geodetic convexity and Kneser graphs ⋮ The general position problem on Kneser graphs and on some graph operations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shifts of the stable Kneser graphs and hom-idempotence
• Kneser's conjecture, chromatic number, and homotopy
• Extremal problems concerning Kneser-graphs
• Homomorphisms of 3-chromatic graphs
• Hypergeometric solutions of linear recurrences with polynomial coefficients
• \(k\)-tuple colorings of the Cartesian product of graphs
• A combinatorical proof of Kneser's conjecture
• Independence and coloring properties of direct products of some vertex-transitive graphs
• On the diameter of Kneser graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• Star chromatic number
• On the Shannon capacity of a graph
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: Independence number of products of Kneser graphs