On partial cubes, well-graded families and their duals with some applications in graphs
Alireza Mofidi

TL;DR
This paper explores the duality of well-graded, extremal, and maximum set systems, characterizes graphs with specific neighborhood properties, and relates these to VC-dimension and half-graphs, advancing understanding in combinatorics and graph theory.
Contribution
It introduces a duality framework for special set systems and applies it to characterize graphs with particular neighborhood structures, linking to VC-dimension and half-graphs.
Findings
Characterization of dual well-graded, extremal, and maximum set systems.
Identification of graph classes with neighborhood systems that are well-graded or extremal.
Connection between these graph classes and VC-dimension, half-graphs.
Abstract
Well-graded families, extremal systems and maximum systems (the last two in the sense of VC-theory and Sauer-Shelah lemma on VC-dimension) are three important classes of set systems. This paper aims to study the notion of duality in the context of these classes of set systems and then use the obtained results for studying graphs. More specifically, we are concerned with the characterization of the finite set systems which themselves and their dual systems are both well-graded, extremal or maximum. On the way to this goal, and maybe also of independent interest, we study the structure of the well-graded families with the property that the size of the system is not much bigger than the size of its essential domain, that is, the set of elements of the domain which are shattered by the system as single element subsets. As another target of the paper, we use the above results to characterize…
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.
