DeepAI AI Chat
Log In Sign Up

On density of subgraphs of halved cubes

by   Victor Chepoi, et al.

Let S be a family of subsets of a set X of cardinality m and VC-dim( S) be the Vapnik-Chervonenkis dimension of S. Haussler, Littlestone, and Warmuth (Inf. Comput., 1994) proved that if G_1( S)=(V,E) is the subgraph of the hypercube Q_m induced by S (called the 1-inclusion graph of S), then |E|/|V|<VC-dim( S). Haussler (J. Combin. Th. A, 1995) presented an elegant proof of this inequality using the shifting operation. In this note, we adapt the shifting technique to prove that if S is an arbitrary set family and G_1,2( S)=(V,E) is the 1,2-inclusion graph of S (i.e., the subgraph of the square Q^2_m of the hypercube Q_m induced by S), then |E|/|V|<d2, where d:=cVC-dim^*( S) is the clique-VC-dimension of S (which we introduce in this paper). The 1,2-inclusion graphs are exactly the subgraphs of halved cubes and comprise subgraphs of Johnson graphs as a subclass.


page 1

page 2

page 3

page 4


On density of subgraphs of Cartesian products

In this paper, we extend two classical results about the density of subg...

Forbidden induced subgraph characterization of circle graphs within split graphs

A graph is circle if its vertices are in correspondence with a family of...

Reconfiguring spanning and induced subgraphs

Subgraph reconfiguration is a family of problems focusing on the reachab...

Induced universal graphs for families of small graphs

We present exact and heuristic algorithms that find, for a given family ...

Testing linear inequalities of subgraph statistics

Property testers are fast randomized algorithms whose task is to disting...

Densest Subgraphs of a Dense Erdös-Rényi Graph. Asymptotics, Landscape and Universality

We consider the problem of estimating the edge density of densest K-node...

Recognizing Generating Subgraphs in Graphs without Cycles of Lengths 6 and 7

Let B be an induced complete bipartite subgraph of G on vertex sets of b...