Perfect matchings in large uniform hypergraphs with large minimum collective degree
type: Item
instance of: scholarly article
title: Perfect matchings in large uniform hypergraphs with large minimum collective degree
zbMATH Open document ID: 1214.05130
author: Vojtěch Rödl
author: Andrzej Ruciński
author: Endre Szemerédi
published in: Journal of Combinatorial Theory. Series A
publication date: 2009-06-17T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5565608
zbMATH Keywords: hypergraph
zbMATH Keywords: perfect matching
zbMATH Keywords: minimum degree
MaRDI profile type: Publication
full work available at URL: j.jcta.2008.10.002
OpenAlex ID: W2144292514
cites work: Perfect matchings in \(r\)-partite \(r\)-graphs
cites work: Q4519896
cites work: Hamiltonian chains in hypergraphs
cites work: Matchings in hypergraphs of large minimum degree
cites work: Perfect matchings in uniform hypergraphs with large minimum degree
cites work: A Dirac-Type Theorem for 3-Uniform Hypergraphs
cites work: An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
DOI: 10.1016/J.JCTA.2008.10.002
description: scientific article; zbMATH DE number 5565608