Induced subsets - MaRDI portal

Cited In (48)

Inclusionwise minimal completely separating systems
Parameterizations of test cover with bounded test sizes
Parameterized and approximation complexity of \textsc{Partial VC Dimension}
Witness Sets
Density and dimension
Disjointly representing set systems
Shattered matchings in intersecting hypergraphs
Shatter Functions with Polynomial Growth Rates
Another algebraic proof of Bondy's theorem on induced subsets
Partially Polynomial Kernels for Set Cover and Test Cover
On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs
Locating-dominating sets and identifying codes in graphs of girth at least 5
Bounds and extremal graphs for total dominating identifying codes
The \textsc{Red-Blue Separation} problem on graphs
Progress towards the two-thirds conjecture on locating-total dominating sets
Set graphs. II. Complexity of set graph recognition and similar problems
On extremal problems concerning the traces of sets
Separation with restricted families of sets
Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
Identifying path covers in graphs
Traces of hypergraphs
A generalization of Sauer's lemma
Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
``Dart calculus of induced subsets
Characterizing extremal graphs for open neighbourhood location-domination
Edge Multiplicity and Other Trace Functions
Separating families of convex sets
Rounds in combinatorial search
The \textsc{red-blue separation} problem on graphs
Extremal Digraphs for open neighbourhood location-domination and identifying codes
Separation and Witnesses
On the trace of finite sets
Defect Sauer results
Domination and location in twin-free digraphs
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension
Arrow relations on families of finite sets
Some best possible bounds concerning the traces of finite sets
Witnessing differences without redundancies
Revisiting and Improving Upper Bounds for Identifying Codes
On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs
Extremal graphs for the identifying code problem
On minimum saturated matrices
Very large cliques are easy to detect
Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
Two proofs of Bondy's theorem on induced subsets and two related questions
Fixed-parameter tractable algorithms for tracking shortest paths
Locally identifying coloring in bounded expansion classes of graphs

This page was built for publication: Induced subsets

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