Making Kr+1-free graphs r-partite
暂无分享,去创建一个
Florian Pfender | Mikhail Lavrov | Felix Christian Clemen | J'ozsef Balogh | Bernard Lidick'y | J. Balogh | Mikhail Lavrov | Florian Pfender | Bernard Lidick'y | F. Clemen
[1] Seid Mohammed,et al. Making a K4-Free Graph Bipartite , 2014 .
[2] Jan Volec,et al. Large Multipartite Subgraphs in H-free Graphs , 2021, Trends in Mathematics.
[3] Zoltán Füredi,et al. A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity , 2015, J. Comb. Theory, Ser. B.
[4] Alexander Roberts,et al. Stability results for graphs with a critical edge , 2016, Eur. J. Comb..
[5] V. Nikiforov. Some new results in extremal graph theory , 2011, 1107.1121.
[6] Elzbieta Sidorowicz,et al. On the Non-(p−1)-Partite Kp-Free Graphs , 2013, Discuss. Math. Graph Theory.
[7] Andrew J. Uzzell,et al. Strong Tur\'an stability , 2014, 1409.8665.
[8] A. Brouwer. Some lotto numbers from an extension of turan's theorem , 1981 .
[9] Wojciech Samotij,et al. The typical structure of sparse $K_{r+1}$-free graphs , 2013, 1307.5967.
[10] P. Erdos,et al. A LIMIT THEOREM IN GRAPH THEORY , 1966 .
[11] Benny Sudakov. Note making a K4-free graph bipartite , 2007, Comb..
[12] A. Scott,et al. Exact stability for Turán’s Theorem , 2020, Advances in Combinatorics.
[13] Paul Erdös,et al. On the connection between chromatic number, maximal clique and minimal degree of a graph , 1974, Discret. Math..
[14] Andrew J. Uzzell,et al. Strong Turán Stability , 2015 .
[15] Paul Erdös,et al. How to make a graph bipartite , 1987, J. Comb. Theory, Ser. B.