The Induced Removal Lemma in Sparse Graphs
From MaRDI portal
Publication:5222577
DOI10.1017/S0963548319000233zbMath1436.05055OpenAlexW2978138901WikidataQ124842221 ScholiaQ124842221MaRDI QIDQ5222577
Publication date: 6 April 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548319000233
Graph theory (including graph drawing) in computer science (68R10) Density (toughness, etc.) (05C42)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A new proof of the graph removal lemma
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Lower bounds of tower type for Szemerédi's uniformity lemma
- Bounds for graph regularity and removal lemmas
- Graph removal lemmas
- The Algorithmic Aspects of the Regularity Lemma
- A sparse regular approximation lemma
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
- Efficient testing of large graphs