Geodesic
An Analytic Approach to Sparse Hypergraphs: Hypergraph Removal
Discrete analysis (2018)

Voir la notice de l'article provenant de la source Scholastica

arXiv
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.
Publié le : 
Henry Towsner. An Analytic Approach to Sparse Hypergraphs: Hypergraph Removal. Discrete analysis (2018). http://geodesic.mathdoc.fr/item/DAS_2018_a19/
@article{DAS_2018_a19,
     author = {Henry Towsner},
     title = {An {Analytic} {Approach} to {Sparse} {Hypergraphs:} {Hypergraph} {Removal}},
     journal = {Discrete analysis},
     year = {2018},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DAS_2018_a19/}
}
TY  - JOUR
AU  - Henry Towsner
TI  - An Analytic Approach to Sparse Hypergraphs: Hypergraph Removal
JO  - Discrete analysis
PY  - 2018
UR  - http://geodesic.mathdoc.fr/item/DAS_2018_a19/
LA  - en
ID  - DAS_2018_a19
ER  - 
%0 Journal Article
%A Henry Towsner
%T An Analytic Approach to Sparse Hypergraphs: Hypergraph Removal
%J Discrete analysis
%D 2018
%U http://geodesic.mathdoc.fr/item/DAS_2018_a19/
%G en
%F DAS_2018_a19