Quasi-random hypergraphs and spanning subhypergraph containment
Advancements in Network Statistics: extensions to HPC and hypergraphs.
| Full text | |
| Author(s): |
Blinovsky, V. M.
[1, 2]
Total Authors: 1
|
| Affiliation: | [1] Univ Sao Paulo, Inst Matemat & Estat, Sao Paulo - Brazil
[2] Russian Acad Sci, Kharkevich Inst Informat Transmiss Problems, Moscow - Russia
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | PROBLEMS OF INFORMATION TRANSMISSION; v. 51, n. 1, p. 25-30, JAN 2015. |
| Web of Science Citations: | 0 |
| Abstract | |
We find an exact formula for the minimum number of edges in a hypergraph which guarantees a fractional matching of cardinality s in the case where sn is an integer. (AU) | |
| FAPESP's process: | 12/13341-8 - Problems in extremal combinatorics |
| Grantee: | Yoshiharu Kohayakawa |
| Support Opportunities: | Research Grants - Visiting Researcher Grant - International |
| FAPESP's process: | 13/07699-0 - Research, Innovation and Dissemination Center for Neuromathematics - NeuroMat |
| Grantee: | Oswaldo Baffa Filho |
| Support Opportunities: | Research Grants - Research, Innovation and Dissemination Centers - RIDC |