Supersaturated Sparse Graphs and Hypergraphs

DOI10.1093/imrn/rny030zbMath1433.05152arXiv1710.04517OpenAlexW2963846904MaRDI QIDQ5216319

Gweneth McKinley, Wojciech Samotij, Asaf Ferber

Publication date: 17 February 2020

Published in: International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.04517

zbMATH Keywords

uniform hypergraphextremal number of a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)

Related Items (8)

Independent sets in algebraic hypergraphs ⋮ Pattern avoidance over a hypergraph ⋮ Counting H-free orientations of graphs ⋮ Counting \(r\)-graphs without forbidden configurations ⋮ Balanced supersaturation for some degenerate hypergraphs ⋮ Counting hypergraphs with large girth ⋮ Random multilinear maps and the Erd\H{o}s box problem ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers

This page was built for publication: Supersaturated Sparse Graphs and Hypergraphs