Perfect matchings in 3-partite 3-uniform hypergraphs

Details Perfect matchings in 3-partite 3-uniform hypergraphs Perfect matchings in 3-partite 3-uniform hypergraphs

2011-03-29

arxiv.org/abs/1103.5654v1

Mathematics

Combinatorics

Scientific paper

Let $H$ be a 3-partite 3-uniform hypergraph with each partition class of size
$n$, that is, a 3-uniform hypergraph such that every edge intersects every
partition class in exactly one vertex. We determine the Dirac-type vertex
degree thresholds for perfect matchings in 3-partite 3-uniform hypergraphs.

Affiliated with

Also associated with

No associations

Rating

Perfect matchings in 3-partite 3-uniform hypergraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Perfect matchings in 3-partite 3-uniform hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Perfect matchings in 3-partite 3-uniform hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-163491