On a theorem of Rademacher-Turán
From MaRDI portal
Publication:773996
zbMath0099.39401MaRDI QIDQ773996
Publication date: 1962
Published in: Illinois Journal of Mathematics (Search for Journal in Brave)
Related Items
On the structure of linear graphs, Minimizing the Number of Triangular Edges, Complete subgraphs in connected graphs and its application to spectral moment, The number of triangles is more when they have no common vertex, Large joints in graphs, Supersaturation in posets and applications involving the container method, A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs, Oriented discrepancy of Hamilton cycles, On a generalized Erdős–Rademacher problem, Structure and supersaturation for intersecting families, On sufficient conditions for rainbow cycles in edge-colored graphs, The minimum number of triangles in graphs of given order and size, Regular Turán numbers and some Gan–Loh–Sudakov‐type problems, THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE, On stability of the Erdős-Rademacher problem, The number of additive triples in subsets of abelian groups, Book free 3-uniform hypergraphs, Sperner's Theorem and a Problem of Erdős, Katona and Kleitman, Asymptotic Structure of Graphs with the Minimum Number of Triangles, Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers, Counting substructures and eigenvalues. I: Triangles, Counting substructures. I: Color critical graphs, Strong Turán stability, Edges not in any monochromatic copy of a fixed graph, Strong forms of stability from flag algebra calculations, On the number of \(K_4\)-saturating edges, On a problem of Erdős and Rothschild on edges in triangles, Cycle-maximal triangle-free graphs, On the KŁR conjecture in random graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Counting substructures. II: Hypergraphs, Supersaturation and stability for forbidden subposet problems., On the number of monotone sequences, Unavoidable hypergraphs, Supersaturation problem for color-critical graphs, Strong Turán stability, Extremal problems involving vertices and edges on odd cycles, Books in graphs, Rainbow triangles and cliques in edge-colored graphs, Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions, Packing triangles in \(K_4\)-free graphs, Supersaturation problem for the bowtie, Frustrated triangles, Books versus Triangles at the Extremal Density, The number of cliques in graphs of given order and size, Asymptotic Structure for the Clique Density Theorem, Short proofs of some extremal results III, Unified approach to the generalized Turán problem and supersaturation, Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, The maximum number of triangles in a \(K_4\)-free graph, The number of complete subgraphs of equi-partite graphs, On the connection between chromatic number, maximal clique and minimal degree of a graph, Supersaturation for subgraph counts
