The following pages link to Induced subsets (Q2544367):
Displaying 38 items.
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Separating families of convex sets (Q364852) (← links)
- On minimum saturated matrices (Q367048) (← links)
- Rounds in combinatorial search (Q378259) (← links)
- Identifying path covers in graphs (Q396675) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Separation with restricted families of sets (Q739393) (← links)
- Domination and location in twin-free digraphs (Q777359) (← links)
- On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
- Very large cliques are easy to detect (Q932700) (← links)
- ``Dart calculus'' of induced subsets (Q1159668) (← links)
- Arrow relations on families of finite sets (Q1182739) (← links)
- Some best possible bounds concerning the traces of finite sets (Q1340130) (← links)
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension (Q1345876) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- On the trace of finite sets (Q1835917) (← links)
- Density and dimension (Q1836212) (← links)
- Disjointly representing set systems (Q1873809) (← links)
- A generalization of Sauer's lemma (Q1899068) (← links)
- Defect Sauer results (Q1903004) (← links)
- Another algebraic proof of Bondy's theorem on induced subsets (Q1971019) (← links)
- On extremal problems concerning the traces of sets (Q2037157) (← links)
- Characterizing extremal graphs for open neighbourhood location-domination (Q2043360) (← links)
- The \textsc{red-blue separation} problem on graphs (Q2169962) (← links)
- Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499) (← links)
- Shattered matchings in intersecting hypergraphs (Q2229336) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Extremal graphs for the identifying code problem (Q2430979) (← links)
- Inclusionwise minimal completely separating systems (Q2431691) (← links)
- Locally identifying coloring in bounded expansion classes of graphs (Q2446886) (← links)
- Traces of hypergraphs (Q4973667) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
- Two proofs of Bondy's theorem on induced subsets and two related questions (Q6121105) (← links)
- The \textsc{Red-Blue Separation} problem on graphs (Q6168089) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)
