Induced subsets
From MaRDI portal
Publication:2544367
DOI10.1016/0095-8956(72)90025-1zbMath0211.56901OpenAlexW4212812385MaRDI QIDQ2544367
Publication date: 1972
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(72)90025-1
Related Items
Disjointly representing set systems, Some best possible bounds concerning the traces of finite sets, Revisiting and Improving Upper Bounds for Identifying Codes, Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets, Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension, A generalization of Sauer's lemma, Defect Sauer results, Separation and Witnesses, The \textsc{red-blue separation} problem on graphs, Separating families of convex sets, On minimum saturated matrices, Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity, Rounds in combinatorial search, Identifying path covers in graphs, Edge Multiplicity and Other Trace Functions, Two proofs of Bondy's theorem on induced subsets and two related questions, Bounds and extremal graphs for total dominating identifying codes, The \textsc{Red-Blue Separation} problem on graphs, Extremal Digraphs for open neighbourhood location-domination and identifying codes, Extremal graphs for the identifying code problem, Inclusionwise minimal completely separating systems, Witnessing differences without redundancies, ``Dart calculus of induced subsets, Fixed-parameter tractable algorithms for tracking shortest paths, Locally identifying coloring in bounded expansion classes of graphs, Witness Sets, Another algebraic proof of Bondy's theorem on induced subsets, Very large cliques are easy to detect, Parameterized and approximation complexity of \textsc{Partial VC Dimension}, Shattered matchings in intersecting hypergraphs, Arrow relations on families of finite sets, Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension, On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs, Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds., Set graphs. II. Complexity of set graph recognition and similar problems, Partially Polynomial Kernels for Set Cover and Test Cover, On extremal problems concerning the traces of sets, Characterizing extremal graphs for open neighbourhood location-domination, Separation with restricted families of sets, Traces of hypergraphs, Shatter Functions with Polynomial Growth Rates, Domination and location in twin-free digraphs, On the trace of finite sets, Density and dimension, On the \textsc{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, Parameterizations of test cover with bounded test sizes
