An Analytic Approach to Sparse Hypergraphs: Hypergraph Removal
Combinatorics
2018-01-24 v5 Dynamical Systems
Logic
Abstract
The use of tools from analysis to approach problems in graph theory has become an active area of research. Usually such methods are applied to problems involving dense graphs and hypergraphs; here we give the an extension of such methods to sparse but pseudorandom hypergraphs. We use this framework to give a proof of hypergraph removal for sub-hypergraphs of sparse random hypergraphs.
Keywords
Cite
@article{arxiv.1204.1884,
title = {An Analytic Approach to Sparse Hypergraphs: Hypergraph Removal},
author = {Henry Towsner},
journal= {arXiv preprint arXiv:1204.1884},
year = {2018}
}