Author:
Cooper Jacob W.,Král' Daniel,Martins Taísa L.
Funder
European Research Council
Leverhulme Trust
Engineering and Physical Sciences Research Council
CNPq
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The GHP scaling limit of uniform spanning trees of dense graphs;Random Structures & Algorithms;2024-02-27
2. Forcing generalised quasirandom graphs efficiently;Combinatorics, Probability and Computing;2023-09-05
3. Forcing Generalized Quasirandom Graphs Efficiently;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
4. Cut distance identifying graphon parameters over weak* limits;Journal of Combinatorial Theory, Series A;2022-07
5. Graph Theory – A Survey on the Occasion of the Abel Prize for László Lovász;Jahresbericht der Deutschen Mathematiker-Vereinigung;2022-03-24