Funder
Anhui Initiative in Quantum Information Technologies grant
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference16 articles.
1. Bermond, J.C., Germa, A., Heydemann, M.C.: Hypergraphes hamiltoniens. Prob. Comb. Theorie Graph Orsay 260, 39–43 (1976)
2. Czygrinow, A., Molla, T.: Tight codegree condition for the existence of loose Hamilton cycles in 3-graphs. SIAM J. Discrete Math. 28, 67–76 (2014)
3. Dirac, G.A.: Some theorems of abstract graphs. Proc. Lond. Math. Soc. 3, 69–81 (1952)
4. Frankl, P., Rödl, V.: Extremal problems on set systems. Random Struct. Algorithms 20, 131–164 (2002)
5. Gyárfás, A., Lehel, J., Sárközy, G., Schelp, R.: Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs. J. Combin. Theory Ser. B 98, 342–358 (2008)