Hypergraph removal with polynomial bounds

DOI10.1017/S0305004125000155MaRDI QIDQ6973315zbMATH OpenFDO

Authors Lior Gishboliner, Asaf Shapira

Publication date 11 June 2025

Published in Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-uniform hypergraphpolynomial boundsregularity lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites work

• A variant of the hypergraph removal lemma
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 2086691 (Why is no real title available?)
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Introduction to Property Testing
• Linear equations, arithmetic progressions and hypergraph property testing
• On 3‐graphs with no four vertices spanning exactly two edges
• On a problem of K. Zarankiewicz
• On extremal problems of graphs and generalized graphs
• On sets of integers containing k elements in arithmetic progression
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• Regularity Lemma for k-uniform hypergraphs
• Testing subgraphs in large graphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The counting lemma for regular k‐uniform hypergraphs

Cited in

(1)

• Posets are easily testable

This page was built for publication: Hypergraph removal with polynomial bounds

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