Author:
Ajtai M.,Komlós J.,Szemerédi E.
Reference11 articles.
1. Fast probabilistic algorithms for Hamilton circuits and matchings;Angluin;J. Comput. System Sci.,1979
2. A note on hamiltonian circuits;Chvátal;Discrete Math.,1972
3. On random graphs;Erdös;I. Publ. Math. (Debrecen),1959
4. On the evolution of random graphs;Erdös;Publ. Math. Inst. Hung. Acad. Sci.,1960
5. On the strength of connectedness of a random graph;Erdös;Acta Math. Acad. Sci. Hung.,1961
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Spanning cycles in random directed graphs;Random Structures & Algorithms;2024-05-15
2. Transference for loose Hamilton cycles in random 3‐uniform hypergraphs;Random Structures & Algorithms;2024-04-12
3. Resilience for loose Hamilton cycles;Procedia Computer Science;2023
4. Hamilton cycles in pseudorandom graphs;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
5. Chvátal-Erdős condition for pancyclicity;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023