On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs (Q5103874): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(4 intermediate revisions by 4 users not shown) | |||
label / en | label / en | ||
On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs | |||
Property / DOI | |||
Property / DOI: 10.22108/toc.2021.127880.1832 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doaj.org/article/41d83838d7184c34a2ee0b7351c8ccfb / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3183137139 / rank | |||
Normal rank | |||
Property / title | |||
On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs (English) | |||
Property / title: On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs (English) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Shattering news / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5668821 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3726125 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: VC-dimension and Erdős-Pósa property / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hypergraph theory. An introduction / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Covering planar graphs with a fixed number of balls / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A sharp upper bound for the number of spanning trees of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5315023 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sharp upper bounds for the number of spanning trees of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An upper bound for the number of spanning trees of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extremal Combinatorics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The VC-dimension of set systems defined by graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of spanning trees of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4530626 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On some dynamical aspects of NIP theories / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On partial cubes, well-graded families and their duals with some applications in graphs / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.22108/TOC.2021.127880.1832 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:56, 30 December 2024
scientific article; zbMATH DE number 7582948
Language | Label | Description | Also known as |
---|---|---|---|
English | On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs |
scientific article; zbMATH DE number 7582948 |
Statements
9 September 2022
0 references
VC-dimension
0 references
cycle hypergraphs of graphs
0 references
spanning tree hypergraphs of graphs
0 references
separating number
0 references
test cover
0 references
On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs (English)
0 references