Author:
Kang Dong Yeap,Kelly Tom,Kühn Daniela,Osthus Deryk,Pfenninger Vincent
Publisher
Springer Science and Business Media LLC
Reference72 articles.
1. Allen, P., Böttcher, J., Corsten, J., Davies, E., Jenssen, M., Morris, P., Roberts, B., Skokan, J.: A robust Corrádi–Hajnal Theorem. arXiv:2209.01116 (2022)
2. Alon, N., Frankl, P., Huang, H., Rödl, V., Ruciński, A., Sudakov, B.: Large matchings in uniform hypergraphs and the conjecture of Erdős and Samuels. J. Comb. Theory Ser. A 119, 1200–1215 (2012)
3. Alon, Y., Krivelevich, M.: Hitting time of edge disjoint Hamilton cycles in random subgraph processes on dense base graphs. SIAM J. Discret. Math. 36, 728–754 (2022)
4. Alweiss, R., Lovett, S., Wu, K., Zhang, J.: Improved bounds for the sunflower lemma. Ann. Math. 194, 795–815 (2021)
5. Barber, B., Glock, S., Kühn, D., Lo, A., Montgomery, R., Osthus, D.: Minimalist designs. Random Struct. Algorithms 57, 47–63 (2020)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献