ON SOME NEW INEQUALITIES CONCERNING EXTREMAL PROPERTIES OF GRAPHS by

By I. Elldős. 2004

122 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/45aed8791f8eacd8c879b56cb4a8561d25912161

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. David Saxton
2. Andrew G. Thomason
3. Vladimir Nikiforov
4. David Conlon
5. Robert Morris
6. Yongtao Li
7. Jozsef Balogh
8. L. Lov'asz

Citations in the corpus

• Some new results in extremal graph theory (2011, methodology): “First we sharpen the classical stability theorem of Erdős [33],[34] and Simonovits [88], which gives information about the structure of graphs without fixed forbidden subgraphs and whose size is close to the maximum possible.”
• Hypergraph containers (2012, background): “Proposition 9.3 (Erdős and Simonovits [20]).”