Perfect matchings in uniform hypergraphs with large minimum degree (Q850084): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Endre Szemerédi / rank
Normal rank
 
Property / author
 
Property / author: Endre Szemerédi / 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.1016/j.ejc.2006.05.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978240867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in \(\varepsilon\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian chains in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in hypergraphs of large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dirac-Type Theorem for 3-Uniform Hypergraphs / rank
 
Normal rank

Latest revision as of 22:53, 24 June 2024

scientific article
Language Label Description Also known as
English
Perfect matchings in uniform hypergraphs with large minimum degree
scientific article

    Statements