Quasi-random hypergraphs and spanning subhypergraph containment
Deep learning and intermediate representations for pediatric image analysis
Continuation of abstract Lyapunov graphs and the maximal number of Betti number va...
| Full text | |
| Author(s): |
Hoppen, Carlos
;
Mota, Guilherme O.
;
Parente, Roberto F.
;
Sato, Cristiane M.
Total Authors: 4
|
| Document type: | Journal article |
| Source: | ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE; v. 346, p. 10-pg., 2019-08-30. |
| Abstract | |
In this paper, we provide an asymptotic formula for the number of k-edge-connected r-uniform hypergraphs with n vertices and m = O(n log n) edges, where r >= 3 and k >= 2 are fixed constants. (AU) | |
| FAPESP's process: | 18/04876-1 - Ramsey theory, structural graph theory and applications in Bioinformatics |
| Grantee: | Guilherme Oliveira Mota |
| Support Opportunities: | Research Grants - Young Investigators Grants |