On the rainbow matching conjecture for 3-uniform hypergraphs (Q2090427): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the size of graphs with complete-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SETS OF INDEPENDENT EDGES OF A HYPERGRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770569 / 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: On the maximum number of edges in a hypergraph with given matching number / 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: On matchings in hypergraphs / 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: The Size of a Hypergraph and its Matching Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a rainbow version of Dirac's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow matchings in k‐partite hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly Perfect Matchings in Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow matchings for 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Erdős' extremal problem on matchings in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new generalization of the Erdős-Ko-Rado theorem / rank
 
Normal rank

Revision as of 14:30, 30 July 2024

scientific article
Language Label Description Also known as
English
On the rainbow matching conjecture for 3-uniform hypergraphs
scientific article

    Statements

    On the rainbow matching conjecture for 3-uniform hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 October 2022
    0 references
    rainbow matching conjecture
    0 references
    Erdős matching conjecture
    0 references
    stability
    0 references

    Identifiers