Author:
Frieze Alan,Krivelevich Michael
Funder
NSF
USA-Israel BSF grant
Israel Science Foundation
Subject
Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software
Reference21 articles.
1. Hamiltonian decompostions of complete k -uniform hypergraphs;Bailey;Discr Math,2010
2. D. Bal A. M. Frieze Packing tight Hamilton cycles in uniform hypergraphs, in press
3. Random Graphs
4. Quasi-random graphs;Chung;Combinatorica,1989
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Decomposing hypergraphs into cycle factors;Journal of Combinatorial Theory, Series B;2023-01
2. Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree;Transactions of the American Mathematical Society;2022-08-16
3. Pseudorandom hypergraph matchings;Combinatorics, Probability and Computing;2020-07-22
4. Euler Tours in Hypergraphs;Combinatorica;2020-05-22
5. Almost all Steiner triple systems are almost resolvable;Forum of Mathematics, Sigma;2020