Estimating parameters associated with monotone properties (Q4993108)

From MaRDI portal

Revision as of 10:07, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 7359168

Language	Label	Description	Also known as
English	Estimating parameters associated with monotone properties	scientific article; zbMATH DE number 7359168

Statements

scholarly article

0 references

Estimating parameters associated with monotone properties (English)

0 references

0 references

Yoshiharu Kohayakawa

0 references

0 references

0 references

Henrique Stagni

0 references

Combinatorics, Probability and Computing

0 references

publication date

15 June 2021

0 references

MaRDI profile type

MaRDI publication profile

0 references

Testing subgraphs in large graphs

0 references

The Algorithmic Aspects of the Regularity Lemma

0 references

Efficient testing of large graphs

0 references

A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity

0 references

A Characterization of the (Natural) Graph Properties Testable with One-Sided Error

0 references

Every Monotone Graph Property Is Testable

0 references

Additive approximation for edge-deletion problems

0 references

The number of graphs without forbidden subgraphs

0 references

The number of <i>K</i> <sub> <i>s,t</i> </sub> -free graphs

0 references

Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring

0 references

Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing

0 references

Bounds for graph regularity and removal lemmas

0 references

Graph removal lemmas

0 references

A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph

0 references

The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent

0 references

0 references

Supersaturated graphs and hypergraphs

0 references

Testing versus Estimation of Graph Properties

0 references

A new proof of the graph removal lemma

0 references

On Regularity Lemmas and their Algorithmic Applications

0 references

Quick approximation to matrices and applications

0 references

0 references

Removal lemmas with polynomial bounds

0 references

Property testing. Current research and surveys

0 references

Property testing and its connection to learning and approximation

0 references

Three theorems regarding testing graph properties

0 references

Lower bounds of tower type for Szemerédi's uniformity lemma

0 references

Estimating parameters associated with monotone properties

0 references

0 references

0 references

Szemerédi's lemma for the analyst

0 references

A sparse regular approximation lemma

0 references

Tolerant property testing and distance approximation

0 references

The asymptotic number of graphs not containing a fixed color-critical subgraph

0 references

Counting \(H\)-free graphs

0 references

0 references

0 references

A variant of the hypergraph removal lemma

0 references

full work available at URL

https://doi.org/10.1017/s0963548320000048

0 references

Identifiers

zbMATH Open document ID

0 references

10.1017/S0963548320000048

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4993108

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4993108&oldid=37217737"