On the domination number of a graph defined by containment (Q2332798): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The domination number of the graph defined by two levels of the \(n\)-cube / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3728934 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Near perfect coverings in graphs and hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5781249 / rank | |||
Normal rank |
Revision as of 20:28, 20 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the domination number of a graph defined by containment |
scientific article |
Statements
On the domination number of a graph defined by containment (English)
0 references
5 November 2019
0 references
finite sets
0 references
hypergraphs
0 references
Turán's theorem
0 references
0 references