Funder
Deutsche Forschungsgemeinschaft
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference28 articles.
1. Packing tight Hamilton cycles in uniform hypergraphs;Bal;SIAM J. Discrete Math.,2012
2. A bandwidth theorem for approximate decompositions;Condon;Proc. Lond. Math. Soc.,2019
3. Proof of the 1-factorization and Hamilton decomposition conjectures;Csaba;Mem. Am. Math. Soc.,2016
4. Pseudorandom hypergraph matchings;Ehard;Comb. Probab. Comput.,2020
5. Counting and packing Hamilton cycles in dense graphs and oriented graphs;Ferber;J. Comb. Theory, Ser. B,2017