The Tuza–Vestergaard Theorem (Q6161262): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q123012554, #quickstatements; #temporary_batch_1719529644846
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/22m1475508 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4381616995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the game total domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals and domination in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small transversals in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings and transversals in hypergraphs, domination and independence in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small transversals in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence in 5-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound on the independence number of a graph and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with large transversal number and with edge sizes at least 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with large transversal number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals in 4-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals in linear uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5104251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy transversals and indecomposable hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals in uniform hypergraphs with property \((p,2)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the transversal numbers of 4-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum size transversals in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination of graphs and small transversals of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering all cliques of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in partitioned graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:13, 1 August 2024

scientific article; zbMATH DE number 7702746
Language Label Description Also known as
English
The Tuza–Vestergaard Theorem
scientific article; zbMATH DE number 7702746

    Statements

    The Tuza–Vestergaard Theorem (English)
    0 references
    0 references
    0 references
    0 references
    27 June 2023
    0 references
    transversal number
    0 references
    6-uniform hypergraph
    0 references

    Identifiers

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