Intersection theorems for infinite families of convex sets in graphs

DOI10.1023/A:1004348709807MaRDI QIDQ1276308zbMATH OpenOpenAlexFDO

Authors Norbert Polat

Publication date 24 January 1999

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1004348709807

zbMATH Keywords

geodesic convexityHelly numberinfinite graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Other problems of combinatorial convexity (52A37)

Review text

A Helly-type theorem determines the least cardinal \(n\) such that any family of ``convex sets in some infinite graph has a nonempty intersection whenever each of its subfamilies of cardinality less than \(n\) has a nonempty intersection. The author studies geodesic convexity. Most of his results ``remain valid if we replace the geodesic convexity by any graph convexity, and in particular, by minimal path convexity.

Recommendations

• A Helly theorem for convexity in graphs
• scientific article; zbMATH DE number 815992
• On Helly's theorem in geodesic spaces
• Convex sets in a graph

Cited in

(6)

• Intersection graphs for families of balls in \(R^n\)
• On the intersection conjecture for infinite trees of matroids
• scientific article; zbMATH DE number 4142072 (Why is no real title available?)
• scientific article; zbMATH DE number 815992 (Why is no real title available?)
• Combinatorial properties for families of \(H\)-convex sets
• A Helly theorem for convexity in graphs

This page was built for publication: Intersection theorems for infinite families of convex sets in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276308)