Author:
Christofides Demetres,Hladký Jan,Máthé András
Funder
Leverhulme Trust
Engineering and Physical Sciences Research Council
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference29 articles.
1. The algorithmic aspects of the regularity lemma;Alon;J. Algorithms,1994
2. Large matchings in uniform hypergraphs and the conjecture of Erdős and Samuels;Alon;J. Combin. Theory Ser. A,2012
3. Long cycles in vertex-transitive graphs;Babai;J. Graph Theory,1979
4. Automorphism groups, isomorphism, reconstruction;Babai,1995
5. Digraphs. Theory, Algorithms and Applications;Bang-Jensen,2009
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On sufficient conditions for spanning structures in dense graphs;Proceedings of the London Mathematical Society;2023-07-21
2. Ore- and Pósa-Type Conditions for Partitioning 2-Edge-Coloured Graphs into Monochromatic Cycles;The Electronic Journal of Combinatorics;2023-05-05
3. Hamilton cycles in pseudorandom graphs;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
4. Tight cycles and regular slices in dense hypergraphs;Journal of Combinatorial Theory, Series A;2017-07
5. The robust component structure of dense regular graphs and applications;Proceedings of the London Mathematical Society;2014-10-20