Author:
Komlós János,Shokoufandeh Ali,Simonovits Miklós,Szemerédi Endre
Publisher
Springer Berlin Heidelberg
Reference132 articles.
1. M. Ajtai, J. Komlós, M. Simonovits and E. Szemerédi, Solution of the Erdős-Sós Conjecture, in preparation.
2. N. Alon, R. Duke, H. Leffman, V. Rödl, R. Yuster, The algorithmic aspects of the regularity lemma, FOCS 33 (1992), 479-481, Journal of Algorithms 16 (1994), 80–109.
3. N. Alon, E. Fischer, 2-factors in dense graphs, Discrete Math.
4. N. Alon, R. Yuster, Almost H-factors in dense graphs, Graphs and Combinatorics 8 (1992), 95–102.
5. N. Alon, R. Yuster, H-factors in dense graphs, J. Combinatorial Theory B66 (1996), 269–282.
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Two-Colored Ramsey–Turán Densities Involving Triangles;SIAM Journal on Discrete Mathematics;2024-07-15
2. On a conjecture of Conlon, Fox, and Wigderson;Combinatorics, Probability and Computing;2024-02-16
3. Some Cubic Time Regularity Algorithms for Triple Systems;SIAM Journal on Discrete Mathematics;2024-02-05
4. Efficient Affinity Propagation Clustering Based on Szemerédi’s Regularity Lemma;Lecture Notes in Computer Science;2024
5. On Perfect Subdivision Tilings;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023