Estimating parameters associated with monotone properties
From MaRDI portal
Publication:4993108
DOI10.1017/S0963548320000048zbMath1504.68165OpenAlexW2563982062WikidataQ101496541 ScholiaQ101496541MaRDI QIDQ4993108
Yoshiharu Kohayakawa, Carlos Hoppen, Richard Lang, Henrique Stagni, Hanno Lefmann
Publication date: 15 June 2021
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548320000048
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new proof of the graph removal lemma
- Property testing. Current research and surveys
- Supersaturated graphs and hypergraphs
- A variant of the hypergraph removal lemma
- Szemerédi's lemma for the analyst
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Quick approximation to matrices and applications
- Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring
- The asymptotic number of graphs not containing a fixed color-critical subgraph
- Lower bounds of tower type for Szemerédi's uniformity lemma
- The number of graphs without forbidden subgraphs
- Counting \(H\)-free graphs
- Bounds for graph regularity and removal lemmas
- Additive approximation for edge-deletion problems
- Tolerant property testing and distance approximation
- Graph removal lemmas
- Property testing and its connection to learning and approximation
- A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
- Every Monotone Graph Property Is Testable
- The Algorithmic Aspects of the Regularity Lemma
- Three theorems regarding testing graph properties
- A sparse regular approximation lemma
- Estimating parameters associated with monotone properties
- Testing subgraphs in large graphs
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
- Removal lemmas with polynomial bounds
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
- On Regularity Lemmas and their Algorithmic Applications
- Testing versus Estimation of Graph Properties
- The number of K s,t -free graphs
- Efficient testing of large graphs
This page was built for publication: Estimating parameters associated with monotone properties
