On the VC-dimension‎, ‎covering and separating properties of the cycle and spanning tree hypergraphs of graphs

DOI10.22108/toc.2021.127880.1832OpenAlexW3183137139MaRDI QIDQ5103874

Alireza Mofidi

Publication date: 9 September 2022

Full work available at URL: https://doaj.org/article/41d83838d7184c34a2ee0b7351c8ccfb

zbMATH Keywords

VC-dimensiontest coverseparating numbercycle hypergraphs of graphsspanning tree hypergraphs of graphs

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Paths and cycles (05C38)

Cites Work

• On some dynamical aspects of NIP theories
• Covering planar graphs with a fixed number of balls
• An upper bound for the number of spanning trees of a graph
• Shattering news
• The VC-dimension of set systems defined by graphs
• Hypergraph theory. An introduction
• On partial cubes, well-graded families and their duals with some applications in graphs
• A sharp upper bound for the number of spanning trees of a graph
• VC-dimension and Erdős-Pósa property
• Extremal Combinatorics
• Sharp upper bounds for the number of spanning trees of a graph
• Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension
• The number of spanning trees of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the VC-dimension‎, ‎covering and separating properties of the cycle and spanning tree hypergraphs of graphs