On the number of copies of one hypergraph in another
From MaRDI portal
Publication:1264288
DOI10.1007/BF02780332zbMath0905.05058MaRDI QIDQ1264288
Publication date: 14 January 1999
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Related Items
Upper tails for subgraph counts in random graphs, Short proofs of some extremal results. II., Upper tails via high moments and entropic stability, Normal approximation and fourth moment theorems for monochromatic triangles, Large deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexes, Inverting the Turán problem, The upper tail problem for induced 4‐cycles in sparse random graphs, KKL's influence on me, The homomorphism domination exponent, Shadows and intersections: Stability and new proofs, Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence, Proof of a hypercontractive estimate via entropy, Lagrangians of hypergraphs. II: When colex is best, A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling, On a Conjecture of Nagy on Extremal Densities, Tight upper tail bounds for cliques
Cites Work
- Some intersection theorems for ordered sets and graphs
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- Inequalities in Fourier analysis
- On Russo's approximate zero-one law
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
- 2-Matchings and 2-covers of hypergraphs
- Unnamed Item
