Author:
Goddard Wayne,Lyle Jeremy
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference18 articles.
1. H-free graphs of large minimum degree;Alon;Electron J Combin,2006
2. On the connection between chromatic number, maximal clique and minimal degree of a graph;Andrásfai;Discrete Math,1974
3. Subgraphs in vertex neighborhoods of Kr-free graphs;Bang-Jensen;J Graph Theory,2004
4. S. Brandt Dense graphs with bounded clique number 2001
5. S. Brandt S. Thomassé Dense triangle-free graphs are four-colourable: a solution to the Erdős-Simonovits problem
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The minimum degree removal lemma thresholds;Journal of Combinatorial Theory, Series B;2024-05
2. Minimum Degree Stability of H-Free Graphs;Combinatorica;2023-02
3. The Minimum Degree Removal Lemma Thresholds;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
4. Minimum degree and the graph removal lemma;Journal of Graph Theory;2022-09-26
5. The chromatic profile of locally bipartite graphs;Journal of Combinatorial Theory, Series B;2022-09