2018 · 23 citations · 30 references
Natural SciencesComputer ScienceMathematicsCombinatoricsSet TheoryTheory Of ComputationCombinatorial Set TheoryGraph TheorySet SystemsCombinatorial Proof TechniquesComputational Complexity Of Graph AlgorithmsLower BoundsUpper Bounds
We prove that for every class of graphs ℒ which is nowhere dense, as defined by Nešetřil and Ossona de Mendez [28, 29], and for every first order formula φ(x, y), whenever one draws a graph G ∈ ℒ and a subset of its nodes A, the number of subsets of A|y| which are of the form {u ∈ A|y|: G |= φ(ū, v)} for some valuation ū of x in G is bounded by O(|A||x|ε), for every ε > 0. This provides optimal bounds on the VC-density of first-order definable set systems in nowhere dense graph classes. We also give two new proofs of upper bounds on quantities in nowhere dense classes which are relevant for their logical treatment. Firstly, we provide a new proof of the fact that nowhere dense classes are uniformly quasi-wide, implying explicit, polynomial upper bounds on the functions relating the two notions. Secondly, we give a new combinatorial proof of the result of Adler and Adler [1] stating that every nowhere dense class of graphs is stable. In contrast to the previous proofs of the above results, our proofs are completely finitistic and constructive, and yield explicit and computable upper bounds on quantities related to uniform quasi-wideness (margins) and stability (ladder indices).
30
Leslie G. Valiant · 1984 · 4.2K citations
Leslie G. Valiant · Communications of the ACM · 1984 · 3.3K citations · Full text
Learnability and the Vapnik-Chervonenkis dimension
Anselm Blumer, Andrzej Ehrenfeucht, David Haussler et al. · Journal of the ACM · 1989 · 1.9K citations · Full text
On the density of families of sets
N. Sauer · Journal of Combinatorial Theory Series A · 1972 · 866 citations