Edge Distribution of Graphs with Few Copies of a Given Graph

DOI10.1017/S0963548306007723zbMath1120.05072OpenAlexW1990574543MaRDI QIDQ3419767

Vladimir Nikiforov

Publication date: 7 February 2007

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548306007723

zbMATH Keywords

cliqueequitable partitionedge distribution

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

Strengthening Rödl's theorem ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Erdős–Hajnal for graphs with no 5‐hole ⋮ A further extension of Rödl's theorem ⋮ Induced Ramsey-type theorems ⋮ Induced Ramsey-type theorems ⋮ Weak hypergraph regularity and linear hypergraphs ⋮ Induced subgraph density. II: Sparse and dense sets in cographs

This page was built for publication: Edge Distribution of Graphs with Few Copies of a Given Graph