Finding tight Hamilton cycles in random hypergraphs faster (2020)
Attributed to:
The sparse hypergraph regularity method
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1017/s0963548320000450
Publication URI: http://dx.doi.org/10.1017/s0963548320000450
Type: Journal Article/Review
Parent Publication: Combinatorics, Probability and Computing
Issue: 2