On the number of subgraphs of prescribed type of graphs with a given number of edges
From MaRDI portal
Publication:1158165
DOI10.1007/BF02761855zbMath0472.05034MaRDI QIDQ1158165
Publication date: 1981
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Related Items
Paths of length four, Walks and paths in trees, Upper tails for subgraph counts in random graphs, The missing log in large deviations for triangle counts, Generalized rainbow Turán problems, A Turán-type problem on distances in graphs, Results on the Wiener profile, Short proofs of some extremal results. II., Upper tails via high moments and entropic stability, The inducibility of complete bipartite graphs, On the maximum number of copies of H in graphs with given size and order, 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, Extremal results on feedback arc sets in digraphs, The upper tail problem for induced 4‐cycles in sparse random graphs, KKL's influence on me, On the Number of 4-Edge Paths in Graphs With Given Edge Density, Algorithmic Aspects of Property Testing in the Dense Graphs Model, The homomorphism domination exponent, Many \(T\) copies in \(H\)-free graphs, The number of $4$-cycles and the cyclomatic number of a finite simple graph, Shadows and intersections: Stability and new proofs, Online Ramsey Numbers and the Subgraph Query Problem, Linear dependence between hereditary quasirandomness conditions, Size Ramsey numbers for some regular graphs, Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence, Many \(T\) copies in \(H\)-free graphs, Lagrangians of hypergraphs. II: When colex is best, On the number of copies of one hypergraph in another, A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling, Unified approach to the generalized Turán problem and supersaturation, On a Conjecture of Nagy on Extremal Densities, Tight upper tail bounds for cliques, On the number of certain subgraphs contained in graphs with a given number of edges
Cites Work
