L_p regular sparse hypergraphs

DOI10.4064/FM364-2-2017MaRDI QIDQ3130505zbMATH OpenOpenAlexFDO

Authors Pandelis Dodos, Vassilis Kanellopoulos, Thodoris Karageorgos

Publication date 22 January 2018

Published in Fundamenta Mathematicae (Search for Journal in Brave)

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

zbMATH Keywords

pseudorandomnessremoval lemmasparse hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42) Hypergraphs (05C65) Classical Banach spaces in the general theory (46B25) Martingales with discrete parameter (60G42)

Abstract: We study sparse hypergraphs which satisfy a mild pseudorandomness condition known as $L_p$ regularity. We prove appropriate regularity and counting lemmas, and we extend the relative removal lemma of Tao in this setting. This answers a question of Borgs, Chayes, Cohn and Zhao.

Recommendations

• \(L_p\) regular sparse hypergraphs: box norms
• Sparse hypergraphs: new bounds and constructions
• Sparse hypergraphs with applications in combinatorial rigidity
• L(p,q)-labeling of sparse graphs
• A note on \([k,l]\)-sparse graphs
• Spectral sparsification of hypergraphs
• Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
• Szemerédi’s Regularity Lemma for Sparse Graphs
• Supersaturated sparse graphs and hypergraphs
• Spanning structures and universality in sparse hypergraphs

Cited in

(6)

• scientific article; zbMATH DE number 1303555 (Why is no real title available?)
• An analytic approach to sparse hypergraphs: hypergraph removal
• Uniformity norms, their weaker versions, and applications
• Regularity inheritance in pseudorandom graphs
• \(L_p\) regular sparse hypergraphs: box norms
• An algorithmic regularity lemma for L_p regular sparse matrices

This page was built for publication: $L_p$ regular sparse hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3130505)