Equality of the Helly and Radon numbers for connected graphs under -convexity
Equality of the Helly and Radon numbers for connected graphs under -convexity
Let be a non-trivial connected graph. Write for its Helly number and for its Radon number with respect to -convexity.
Helly–Radon equality conjecture.
The conjecture proposes that, unlike in most familiar convexities on discrete structures, the Helly and Radon numbers coincide for every non-trivial connected graph under -convexity. The equality is established in the paper for chordal graphs, and the authors report it for all small graphs examined, but it remains open in general.
Sources & referencesView supporting material
Primary source
Bijo S Anand, Arun Anil, Manoj Changat, Revathy S. Nair and Prasanth G. Narasimha-Shenoi, “Helly Number, Radon Number and Rank in Δ-Convexity on Graphs”, arXiv:2411.10816 (2024).
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.