Pages that link to "Item:Q1264288"
From MaRDI portal
The following pages link to On the number of copies of one hypergraph in another (Q1264288):
Displaying 19 items.
- Short proofs of some extremal results. II. (Q326811) (← links)
- The homomorphism domination exponent (Q648968) (← links)
- Shadows and intersections: Stability and new proofs (Q932174) (← links)
- Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence (Q965817) (← links)
- Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
- Upper tails for subgraph counts in random graphs (Q1881736) (← links)
- Lagrangians of hypergraphs. II: When colex is best (Q2040206) (← links)
- Upper tails via high moments and entropic stability (Q2165741) (← links)
- Inverting the Turán problem (Q2421851) (← links)
- Tight upper tail bounds for cliques (Q3145838) (← links)
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) (← links)
- On a Conjecture of Nagy on Extremal Densities (Q5854460) (← links)
- Proof of a hypercontractive estimate via entropy (Q5951519) (← links)
- Normal approximation and fourth moment theorems for monochromatic triangles (Q6074673) (← links)
- Large deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexes (Q6076726) (← links)
- The upper tail problem for induced 4‐cycles in sparse random graphs (Q6119225) (← links)
- KKL's influence on me (Q6198636) (← links)
- Kruskal-Katona-type problems via the entropy method (Q6615764) (← links)
- Fluctuations of quadratic chaos (Q6629005) (← links)
