Author:
Győri Ervin,Katona Gyula Y.,Lemons Nathan
Funder
Hungarian National Research Fund
Department of Energy at Los Alamos National Laboratory
DOE Office of Science Advanced Computing Research (ASCR) program
Subject
Discrete Mathematics and Combinatorics
Reference15 articles.
1. P. Allen, J. Böttcher, O. Cooley, R. Mycroft, Tight cycles and regular slices in dense hypergraphs, manuscript.
2. Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs;Dorbec;J. Graph Theory,2008
3. On maximal paths and circuits of graphs;Erdős;Acta Math. Acad. Sci. Hungar.,1959
4. Exact solution of some Turán-type problems;Frankl;J. Combin. Theory Ser. A,1987
5. Extremal k-edge Hamiltonian hypergraphs;Frankl;Discrete Math.,2008
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献