On partial cubes, well-graded families and their duals with some applications in 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 graphs whose set systems of open or closed neighbourhoods, cliques or independent sets are well-graded, extremal or maximum. We clarify the relation of such graphs to the celebrated half-graphs. Through the paper, we frequently relate our investigations to the VC-dimension of the systems. Also we use one-inclusion graphs associated to set systems as an important technical tool.

[1]  Komei Fukuda,et al.  Antipodal graphs and oriented matroids , 1993, Discret. Math..

[2]  Béla Bollobás,et al.  Reverse Kleitman Inequalities , 1989 .

[3]  Sergei Ovchinnikov.  Media theory: Representations and examples , 2008, Discret. Appl. Math..

[4]  Hans-Jürgen Bandelt,et al.  Combinatorics of lopsided sets , 2006, Eur. J. Comb..

[5]  G. Greco,et al.  Embeddings and the Trace of Finite Sets , 1998, Inf. Process. Lett..

[6]  Béla Bollobás,et al.  Defect Sauer Results , 1995, J. Comb. Theory A.

[7]  Norbert Sauer,et al.  On the Density of Families of Sets , 1972, J. Comb. Theory A.

[8]  Shay Moran,et al.  Shattering, Graph Orientations, and Connectivity , 2012, Electron. J. Comb..

[9]  David Conlon,et al.  Bounds for graph regularity and removal lemmas , 2011, ArXiv.

[10]  Shay Moran,et al.  Labeled Compression Schemes for Extremal Classes , 2015, ALT.

[11]  Peter L. Bartlett,et al.  Bounding Embeddings of VC Classes into Maximum Classes , 2014, ArXiv.

[12]  Elke Wilkeit,et al.  Isometric embeddings in Hamming graphs , 1990, J. Comb. Theory, Ser. B.

[13]  Sandi Klavzar,et al.  Partial Cubes and Crossing Graphs , 2002, SIAM J. Discret. Math..

[14]  Wilfried Imrich,et al.  Fast recognition algorithms for classes of partial cubes , 2003, Discret. Appl. Math..

[15]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.

[16]  S. Shelah,et al.  Regularity lemmas for stable graphs , 2011, 1102.3904.

[17]  Jean-Claude Falmagne,et al.  Well-graded families of relations , 1997, Discret. Math..

[18]  David Eppstein,et al.  Algorithms for media , 2002, Discret. Appl. Math..

[19]  Bojan Mohar,et al.  Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations , 1995, J. Chem. Inf. Comput. Sci..

[20]  Heping Zhang,et al.  None of the coronoid systems can be isometrically embedded into a hypercube , 2008, Discret. Appl. Math..

[21]  Sergei Ovchinnikov,et al.  Graphs and Cubes , 2011 .

[22]  David Haussler,et al.  Predicting {0,1}-functions on randomly drawn points , 1988, COLT '88.

[23]  Shay Moran,et al.  Shattering-Extremal Systems , 2012, ArXiv.

[24]  S. Shelah.  A combinatorial problem; stability and order for models and theories in infinitary languages. , 1972 .

[25]  Sergei Ovchinnikov,et al.  Partial cubes: structures, characterizations, and constructions , 2007, Discret. Math..

[26]  David Eppstein,et al.  Media theory , 2007 .

[27]  Sandi Klavzar,et al.  Tribes of Cubic Partial Cubes , 2007, Discret. Math. Theor. Comput. Sci..

[28]  David Eppstein.  The lattice dimension of a graph , 2005, Eur. J. Comb..

[29]  J. Lawrence.  Lopsided sets and orthant-intersection by convex sets , 1983 .

[30]  Ronald L. Graham,et al.  On the addressing problem for loop switching , 1971 .

[31]  D. Djoković.  Distance-preserving subgraphs of hypercubes , 1973 .

[32]  W. Imrich,et al.  Product Graphs: Structure and Recognition , 2000 .

[33]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[34]  Saharon Shelah,et al.  Classification theory - and the number of non-isomorphic models, Second Edition , 1990, Studies in logic and the foundations of mathematics.

[35]  Sergei Ovchinnikov,et al.  Media theory , 2002, Discret. Appl. Math..

[36]  Kolja B. Knauer,et al.  Convexity in partial cubes: The hull number , 2013, Discret. Math..

[37]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[38]  Peter L. Bartlett,et al.  Shifting: One-inclusion mistake bounds and sample compression , 2009, J. Comput. Syst. Sci..

[39]  Sandi Klavzar,et al.  Convex excess in partial cubes , 2012, J. Graph Theory.

[40]  Sandi Klavzar,et al.  Computing distance moments on graphs with transitive Djoković-Winkler relation , 2014, Discret. Appl. Math..

[41]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[42]  Manfred K. Warmuth,et al.  Unlabeled Compression Schemes for Maximum Classes, , 2007, COLT.

[43]  L. Rónyai,et al.  Shattering-Extremal Set Systems of Small VC-Dimension , 2012, 1211.0732.