Author:
Balogh József,Samotij Wojciech
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference24 articles.
1. J. Balogh, B. Bollobás and M. Simonovits: The fine structure of octahedron-free graphs, Journal of Combinatorial Theory B 101(2) (2011), 67–84.
2. J. Balogh, B. Bollobás and M. Simonovits: The number of graphs without forbidden subgraphs, Journal of Combinatorial Theory B 91 (2004), 1–24.
3. J. Balogh, B. Bollobás and M. Simonovits: The typical structure ofgraphs without given excluded subgraphs, Random Structures and Algorithms 34 (2009), 305–318.
4. J. Balogh and W. Samotij: Almost all C 4-free graphs have fewer than (1−ɛ) · ex(n,C 4) edges, SIAM Journal on Discrete Mathematics 24(3) (2010), 1011–1018.
5. J. Balogh and W. Samotij: The number of K s,t-free graphs, Journal of the London Mathematical Society Advance Access published February 1, 2011, doi:10.1112/ jlms/jdq086.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献