Convex geometries over induced paths with bounded length
Marisa Gutierrez, F\'abio Protti, Silvia B. Tondato

TL;DR
This paper introduces and characterizes $l^k$-convex geometries in graphs, focusing on cases where $k=2$ and $k=3$, revealing new classes of convex geometries with specific structural properties.
Contribution
The paper defines $l^k$-convexity as a restriction of monophonic convexity and characterizes $l^k$-convex geometries for $k=2,3$, including the first non-hereditary convex geometry class.
Findings
Characterization of $l^2$-convex geometries as chordal $P_4$-free graphs.
Characterization of $l^3$-convex geometries as chordal graphs with diameter at most three and a special gem property.
Introduction of a new non-hereditary class of convex geometries.
Abstract
Graph convexity spaces have been studied in many contexts. In particular, some studies are devoted to determine if a graph equipped with a convexity space is a {\em convex geometry}. It is well known that chordal and Ptolemaic graphs can be characterized as convex geometries with respect to the geodesic and monophonic convexities, respectively. Weak polarizable graphs, interval graphs, and proper interval graphs can also be characterized in this way. In this paper we introduce the notion of {\em -convexity}, a natural restriction of the monophonic convexity. Let be a graph and an integer. A subset is \textit{-convex} if and only if for any pair of vertices of , each induced path of length {\em at most} connecting and is completely contained in the subgraph induced by . The {\em -convexity} consists of all…
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.
