Burcroff's irredundance conjecture for direct products of balanced complete multipartite graphs
Burcroff's irredundance conjecture for direct products of balanced complete multipartite graphs
Let be a direct product of balanced complete multipartite graphs. The independence number is the largest size of an independent set, and is the maximum size of an irredundant set. Burcroff's conjecture.
This strengthens the earlier conjecture that the independence number equals the upper domination number for these products. The conjecture is known in the cases and , but the source does not establish its general resolution.
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.