How unproportional must a graph be? (Q1663804): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q222637
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Alexander D. Scott / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962916897 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1404.1206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A central limit theorem for decomposable random variables with applications to random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersections of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersections of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak quasi-randomness for uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5723196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting a graph into two dissimilar halves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imbalances in k‐colorations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph norms and Sidorenko's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A functional limit theorem for random graphs with applications to subgraph count statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal decompositions and functional limit theorems for random graph statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph Fourier transform and proportional graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proportional graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic distributions of generalized U-statistics with applications to random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic construction of proportional graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of proportional graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The poset of hypergraph quasirandomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4899293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>σ</i>-algebras for quasirandom hypergraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:15, 16 July 2024

scientific article
Language Label Description Also known as
English
How unproportional must a graph be?
scientific article

    Statements

    How unproportional must a graph be? (English)
    0 references
    0 references
    0 references
    0 references
    24 August 2018
    0 references
    binomial random graph
    0 references

    Identifiers