The minimum number of vertices in uniform hypergraphs with given domination number (Q2401806): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Csilla Bujtás / rank
Normal rank
 
Property / author
 
Property / author: Csilla Bujtás / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2295887539 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59072368 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1603.03557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3012384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equality of domination and transversal numbers in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals and domination in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total transversals and total domination in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Distance Domination Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a majority ball with majority answers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum inequalities for domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance domination in graphs with given minimum and maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with large domination number and with edge sizes at least three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph domination and strong independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between packing and covering numbers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical hypergraphs and interesting set-pair systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for two set systems with prescribed intersections / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:15, 14 July 2024

scientific article
Language Label Description Also known as
English
The minimum number of vertices in uniform hypergraphs with given domination number
scientific article

    Statements

    The minimum number of vertices in uniform hypergraphs with given domination number (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 September 2017
    0 references
    hypergraph
    0 references
    domination number
    0 references
    distance domination
    0 references
    multiple domination
    0 references
    extremal problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references