Helly Number, Radon Number and Rank in $\Delta$-Convexity on Graphs
Bijo S Anand, Arun Anil, Manoj Changat, Revathy S.Nair, Prasanth G., Narasimha-Shenoi

TL;DR
This paper investigates $$-convexity on graphs, providing bounds and exact values for Helly and Radon numbers, and rank, especially for special classes like chordal and block graphs.
Contribution
It establishes general bounds and exact values for Helly, Radon numbers, and rank in $$-convexity on graphs, advancing understanding of convexity properties in graph theory.
Findings
Bounds for Helly, Radon numbers, and rank in $$-convexity.
Exact Helly and Radon numbers for chordal graphs.
Rank determination for block graphs.
Abstract
This article discusses -convexity on simple connected graphs. We establish general bounds for the Helly number, Radon number, and rank with respect to -convexity on graphs. Additionally, we give the exact values for the Helly number and Radon number for chordal graphs, as well as the rank for block graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Graph theory and applications · Limits and Structures in Graph Theory
