Triangles in H-free graphs

[1]  JE MET,et al.  Wiskundige Opgaven , 1892 .

[2]  R. Salem,et al.  On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. , 1942, Proceedings of the National Academy of Sciences of the United States of America.

[3]  F. Behrend.  On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. , 1946, Proceedings of the National Academy of Sciences of the United States of America.

[4]  P. Erdös,et al.  On the structure of linear graphs , 1946 .

[5]  V. Sós,et al.  On a problem of K. Zarankiewicz , 1954 .

[6]  P. Erdos,et al.  On maximal paths and circuits of graphs , 1959 .

[7]  P. Erdös.  On the structure of linear graphs , 1946 .

[8]  P. Erdös.  On an extremal problem in graph theory , 1970 .

[9]  P. Erdös.  On extremal problems of graphs and generalized graphs , 1964 .

[10]  W. G. Brown.  On Graphs that do not Contain a Thomsen Graph , 1966, Canadian Mathematical Bulletin.

[11]  M. Simonovits,et al.  Cycles of even length in graphs , 1974 .

[12]  B. Bollobás.  On complete subgraphs of different orders , 1976, Mathematical Proceedings of the Cambridge Philosophical Society.

[13]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[14]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[15]  J. Sheehan,et al.  On the number of complete subgraphs contained in certain graphs , 1981, J. Comb. Theory, Ser. B.

[16]  Vojtech Rödl,et al.  Large triangle-free subgraphs in graphs withoutK4 , 1986, Graphs Comb..

[17]  Miklós Simonovits,et al.  On the maximal number of certain subgraphs inKr-free graphs , 1991, Graphs Comb..

[18]  V. Rödl,et al.  Threshold functions for Ramsey properties , 1995 .

[19]  Zoltán Füredi,et al.  On the Number of Edges of Quadrilateral-Free Graphs , 1996, J. Comb. Theory, Ser. B.

[20]  Zoltán Füredi,et al.  New Asymptotics for Bipartite Turán Numbers , 1996, J. Comb. Theory, Ser. A.

[21]  T. Lu.  ON K4-FREE SUBGRAPHS OF RANDOM GRAPHS , 1997 .

[22]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[23]  Noga Alon,et al.  Norm-Graphs: Variations and Applications , 1999, J. Comb. Theory, Ser. B.

[24]  N. Alon,et al.  Constructive lower bounds for off-diagonal Ramsey numbers , 2001 .

[25]  L. Moser,et al.  AN EXTREMAL PROBLEM IN GRAPH THEORY , 2001 .

[26]  P. Erdgs,et al.  ON MAXIMAL PATHS AND CIRCUITS OF GRAPHS , 2002 .

[27]  Tibor Szabó.  On the spectrum of projective norm-graphs , 2003, Inf. Process. Lett..

[28]  Felix Lazebnik,et al.  On Hypergraphs of Girth Five , 2003, Electron. J. Comb..

[29]  S. Janson,et al.  Upper tails for subgraph counts in random graphs , 2004 .

[30]  Vojtech Rödl,et al.  Sharp Bounds For Some Multicolor Ramsey Numbers , 2005, Comb..

[31]  B. Sudakov,et al.  Pseudo-random Graphs , 2005, math/0503745.

[32]  M. A. Perles.  ON THE NUMBER OF SUBGRAPHS OF PRESCRIBED TYPE OF GRAPHS WITH A GIVEN NUMBER OF EDGES* , 2007 .

[33]  V. Nikiforov.  Graphs with many r‐cliques have large complete r‐partite subgraphs , 2007, math/0703554.

[34]  Béla Bollobás,et al.  Pentagons vs. triangles , 2008, Discret. Math..

[35]  W. T. Gowers,et al.  Combinatorial theorems in sparse random sets , 2010, 1011.4310.

[36]  Jacob Fox,et al.  A new proof of the graph removal lemma , 2010, ArXiv.

[37]  Hao Li,et al.  The Maximum Number of Triangles in C2k+1-Free Graphs , 2012, Combinatorics, Probability and Computing.

[38]  Andrzej Grzesik.  On the maximum number of five-cycles in a triangle-free graph , 2012, J. Comb. Theory, Ser. B.

[39]  D. Saxton,et al.  Hypergraph containers , 2012, 1204.6595.

[40]  Miklós Simonovits,et al.  Paul Erdős' Influence on Extremal Graph Theory , 2013, The Mathematics of Paul Erdős II.

[41]  Jan Hladký,et al.  On the number of pentagons in triangle-free graphs , 2013, J. Comb. Theory, Ser. A.

[42]  Benny Sudakov,et al.  Maximizing the Number of Independent Sets of a Fixed Size , 2015, Comb. Probab. Comput..

[43]  Alexandr V. Kostochka,et al.  On independent sets in hypergraphs , 2011, Random Struct. Algorithms.

[44]  Alexandr V. Kostochka,et al.  Turán Problems and Shadows III: Expansions of Graphs , 2014, SIAM J. Discret. Math..

[45]  M. Schacht.  Extremal results for random discrete structures , 2016, 1603.00894.

[46]  Boris Bukh,et al.  A Bound on the Number of Edges in Graphs Without an Even Cycle , 2014, Combinatorics, Probability and Computing.

[47]  Zoltán Füredi,et al.  On 3-uniform hypergraphs without a cycle of a given length , 2014, Discret. Appl. Math..