Helly Number, Radon Number and Rank in -Convexity on 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.