Monochromatic subgraphs in randomly colored graphons (Q2323107): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2019.06.007 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963343769 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1707.05889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5508534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of the mean-field for the Potts model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Closeness of Discrete Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collision times in multicolor urn models and sequential graph coloring with applications to discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal limit theorems in graph coloring problems with connections to extremal combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference in Ising models / 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: Convergent sequences of dense graphs. II. Multiway cuts and statistical physics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3580914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating and understanding exponential random graph models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The large deviation principle for the Erdős-Rényi random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matching, birthday and the strong birthday problem: a contemporary review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-uniform birthday problem with applications to discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2822602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4899293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicollision Attacks on Some Generalized Sequential Hash Functions / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127567948 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2019.06.007 / rank
 
Normal rank

Latest revision as of 00:20, 18 December 2024

scientific article
Language Label Description Also known as
English
Monochromatic subgraphs in randomly colored graphons
scientific article

    Statements

    Monochromatic subgraphs in randomly colored graphons (English)
    0 references
    0 references
    30 August 2019
    0 references
    monochromatic \(s\)-cliques
    0 references
    uniformly random coloring
    0 references

    Identifiers