Quasi-random hypergraphs and spanning subhypergraph containment
Advancements in Network Statistics: extensions to HPC and hypergraphs.
Phenotypic divergence and ecological speciation in mutualisms: effects of spatial ...
| Full text | |
| Author(s): |
Total Authors: 2
|
| Affiliation: | [1] Univ Birmingham, Sch Math, Birmingham B15 2TT, W Midlands - England
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | JOURNAL OF COMBINATORIAL THEORY SERIES B; v. 128, p. 175-191, JAN 2018. |
| Web of Science Citations: | 0 |
| Abstract | |
Let k >= 3 be an odd integer and let n be a sufficiently large integer. We prove that the maximum number of edges in an n-vertex k-uniform hypergraph containing no 2-regular subgraphs is ((n-1)(k-1)) + left perpendicular n-1/k right perpendicular, and the equality holds if and only if H is a full k-star with center v together with a maximal matching omitting v. This verifies a conjecture of Mubayi and Verstraete. (C) 2017 Elsevier Inc. All rights reserved. (AU) | |
| FAPESP's process: | 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science |
| Grantee: | Carlos Eduardo Ferreira |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 14/18641-5 - Hamilton cycles and tiling problems in hypergraphs |
| Grantee: | Jie Han |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 15/07869-8 - Perfect matchings and Tilings in hypergraphs |
| Grantee: | Jie Han |
| Support Opportunities: | Scholarships abroad - Research Internship - Post-doctor |