On Erdos' extremal problem on matchings in hypergraphs

Details On Erdos' extremal problem on matchings in hypergraphs On Erdos' extremal problem on matchings in hypergraphs

2012-02-19

arxiv.org/abs/1202.4196v1

Mathematics

Combinatorics

Scientific paper

In 1965 Erd\H{o}s conjectured that the number of edges in k-uniform
hypergraphs on n vertices in which the largest matching has s edges is
maximized for hypergraphs of one of two special types. We settled this
conjecture in the affirmative for k=3 and n is large enough.

Affiliated with

Also associated with

No associations

Rating

On Erdos' extremal problem on matchings in 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 On Erdos' extremal problem on matchings in hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Erdos' extremal problem on matchings in hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-563694