Estimating parameters associated with monotone properties (Q4993108): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Testing subgraphs in large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient testing of large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of the (Natural) Graph Properties Testable with One-Sided Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Monotone Graph Property Is Testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive approximation for edge-deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of graphs without forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of <i>K</i> <sub> <i>s,t</i> </sub> -free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for graph regularity and removal lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph removal lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturated graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing versus Estimation of Graph Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the graph removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Regularity Lemmas and their Algorithmic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick approximation to matrices and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4866084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removal lemmas with polynomial bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing. Current research and surveys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems regarding testing graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds of tower type for Szemerédi's uniformity lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating parameters associated with monotone properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Szemerédi's lemma for the analyst / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse regular approximation lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerant property testing and distance approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of graphs not containing a fixed color-critical subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4175585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of the hypergraph removal lemma / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s0963548320000048 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2563982062 / rank
 
Normal rank

Latest revision as of 11:07, 30 July 2024

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

    Estimating parameters associated with monotone properties (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 June 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references