The irredundance conjecture for direct products of complete multipartite graphs
The irredundance conjecture for direct products of complete multipartite graphs
Let be complete multipartite graphs, and let . The independence number is the largest size of an independent set, and is the maximum size of an irredundant set. Irredundance conjecture.
This removes the assumption that the factors are balanced and is presented as a strengthening of Burcroff's conjecture. The source does not provide a resolution of this broader statement.
Sources & referencesView supporting material
Primary source
Noga Alon and Colin Defant, “Isoperimetry, Stability, and Irredundance in Direct Products”, arXiv:1904.02595 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.