Efficient removal without efficient regularity

DOI10.1007/s00493-018-3899-6zbMath1438.05136arXiv1709.08159OpenAlexW2963246532WikidataQ128490327 ScholiaQ128490327MaRDI QIDQ2322546

Asaf Shapira, Lior Gishboliner

Publication date: 4 September 2019

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationextremal combinatoricstriangle removal lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial optimization (90C27)

Related Items (6)

Testing graphs against an unknown distribution ⋮ A characterization of easily testable induced digraphs and \(k\)-colored graphs ⋮ Polynomial removal lemmas for ordered graphs ⋮ On 3‐graphs with no four vertices spanning exactly two edges ⋮ Local-vs-global combinatorics ⋮ On the Query Complexity of Estimating the Distance to Hereditary Graph Properties

This page was built for publication: Efficient removal without efficient regularity