On the domination number of a graph defined by containment (Q2332798): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.2140/moscow.2019.8.379 / rank | |||
Property / author | |||
Property / author: Peter Frankl / rank | |||
Property / author | |||
Property / author: Peter Frankl / rank | |||
Normal 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://doi.org/10.2140/moscow.2019.8.379 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2980106885 / rank | |||
Normal rank | |||
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 | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127090482 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.2140/MOSCOW.2019.8.379 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:20, 18 December 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