Rainbow matchings in k‐partite hypergraphs (Q4996918): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Rainbow <i>r</i>-Partite Version of the Erdős–Ko–Rado Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit construction of linear sized tolerant networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration Inequalities and Martingale Inequalities: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for Erdős' matching conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Erdős matching conjecture in a new range / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple juntas for shifted families / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Size of a Hypergraph and its Matching Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Rainbow Matchings for Hypergraphs / rank
 
Normal rank

Revision as of 03:37, 26 July 2024

scientific article; zbMATH DE number 7367041
Language Label Description Also known as
English
Rainbow matchings in k‐partite hypergraphs
scientific article; zbMATH DE number 7367041

    Statements

    Identifiers

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