scientific article; zbMATH DE number 3900799
[For the entire collection see Zbl 0546.00007.] For a graph \(H\) and an integer \(n\geq 1\), let \(\text{ex}(n,H)\) denote the maximum number of edges of a graph \(G\) on \(n\) vertices that contains no copy of \(H\). This paper considers the following conjecture: for every graph \(H\) with \(v\) vertices and \(e\) edges and for every \(c>0\), there is a constant \(d>0\) such that every graph \(G\) on \(n\) vertices with \(E\geq (1+c)\text{ex}(n,H)\) edges contains at least \(d\cdot E^e/n^{2e-v}\) copies of \(H\). This conjecture holds for every nonbipartite H by the results of the authors [Combinatorica 3, 181-192 (1983; Zbl 0529.05027)]. (See also [\textit{P. Frankl} and \textit{V. Rödl}, Hypergraphs do not jump, ibid. 4, 149-159 (1984)].) If true, the conjecture is best possible. This interesting paper proves the conjecture and some related results for various special cases.
- Supersaturation of C₄: from Zarankiewicz towards Erdős-Simonovits-Sidorenko
- Anti-Ramsey numbers of subdivided graphs
- Some extremal results on 4-cycles
- Unified approach to the generalized Turán problem and supersaturation
- The sensitivity conjecture, induced subgraphs of cubes, and Clifford algebras
- Non-bipartite \(k\)-common graphs
- The number of copies of \(K_{2,t+1}\) in a graph
- On even-cycle-free subgraphs of the doubled Johnson graphs
- Extremal even-cycle-free subgraphs of the complete transposition graphs
- Supergraphs and the cubic Leigh-Strassler model
- On the chromatic number of the Erdős-Rényi orthogonal polarity graph
- The number of 4-cycles in a graph
- The Turán number of blow-ups of trees
- Two approaches to Sidorenko's conjecture
- The number of \(C_{2\ell}\)-free graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Color the cycles
- Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product
- Supersaturation of even linear cycles in linear hypergraphs
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- On a conjecture of Nagy on extremal densities
- On even-cycle-free subgraphs of the hypercube
- Tree-Degenerate Graphs and Nested Dependent Random Choice
- Toward characterizing locally common graphs
- Balanced supersaturation for some degenerate hypergraphs
- On the number of \(\mathcal{H}\)-free hypergraphs
- Counting substructures and eigenvalues. II: Quadrilaterals
- Some exact results on 4-cycles: stability and supersaturation
- Clique supersaturation
- Rational exponents for cliques
- The binomial random graph is a bad inducer
- Sidorenko's conjecture for subdivisions and theta substitutions
- Supersaturation of odd linear cycles
- Supersaturated graphs and hypergraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3679225)