Exact minimum degree thresholds for perfect matchings in uniform hypergraphs

Authors:
Andrew Treglown;Yi Zhao
Affiliations:
Computer Science Institute, Faculty of Mathematics and Physics, Charles University, Malostranské Námstí 25, 118 00 Prague, Czech Republic;Department of Mathematics and Statistics, Georgia State University, Atlanta, GA 30303, USA
Venue:
Journal of Combinatorial Theory Series A
Year:
2012

Citing 11
Cited 1

A Dirac-Type Theorem for 3-Uniform Hypergraphs

Combinatorics, Probability and Computing
Applications of the regularity lemma for uniform hypergraphs

Random Structures & Algorithms
On A Hypergraph Turán Problem Of Frankl

Combinatorica
Perfect matchings in uniform hypergraphs with large minimum degree

European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
Matchings in hypergraphs of large minimum degree

Journal of Graph Theory
Perfect Matchings and K 43-Tilings in Hypergraphs of Large Codegree

Graphs and Combinatorics
Perfect matchings in r-partite r-graphs

European Journal of Combinatorics
Perfect matchings in large uniform hypergraphs with large minimum collective degree

Journal of Combinatorial Theory Series A
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree

SIAM Journal on Discrete Mathematics
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees

European Journal of Combinatorics
Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels

Journal of Combinatorial Theory Series A

Polynomial-time perfect matchings in dense hypergraphs

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given positive integers k and @? where 4 divides k and k/2=