Name
Abstract | ||
|---|---|---|
In 1965 Erdos 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 large enough. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.jcta.2014.01.003 | J. Comb. Theory, Ser. A |
Keywords | Field | DocType |
largest matching,n vertex,n large enough,special type,k-uniform hypergraphs,extremal problem,matching,extremal graph theory,hypergraphs | Discrete mathematics,Combinatorics,Vertex (geometry),Constraint graph,3-dimensional matching,Extremal graph theory,Conjecture,Mathematics | Journal |
Volume | ISSN | Citations |
124, | 0097-3165 | 9 |
PageRank | References | Authors |
0.81 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomasz Łuczak | 1 | 225 | 40.26 |
| Katarzyna Mieczkowska | 2 | 20 | 1.85 |