Bounding the trace function of a hypergraph with applications
From MaRDI portal
Publication:2089531
DOI10.1007/978-3-031-05375-7_8zbMath1500.05047arXiv2007.13016OpenAlexW3044885188MaRDI QIDQ2089531
Publication date: 22 October 2022
Full work available at URL: https://arxiv.org/abs/2007.13016
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Open neighborhood locating-dominating in trees
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- \(\epsilon\)-nets and simplex range queries
- The VC-dimension of set systems defined by graphs
- Parameterized and approximation complexity of \textsc{Partial VC Dimension}
- On limited nondeterminism and the complexity of the V-C dimension
- Bounds on the identifying codes in trees
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs
- Complexity results for identifying codes in planar graphs
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension
- Domination and location in acyclic graphs
- Total domination in graphs
- On a new class of codes for identifying vertices in graphs
- Identifying Codes in Line Graphs
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
