Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets (Q532131): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2074400847 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0804.0753 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quasi-Random Set Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quasi-random tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quasi-random hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quasi-random graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quasirandom Groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5477817 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalized quasirandom graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quasi-randomness and the distribution of copies of a fixed graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3825110 / rank | |||
Normal rank |
Latest revision as of 00:30, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets |
scientific article |
Statements
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets (English)
0 references
26 April 2011
0 references
A graph \(G(n)\) is \(p\)-quasi-random if it behaves like the random graph \(G(n,p)\) for sufficiently large \(n\) and any \(0<p<1\). It is proved that \(G(n)\) is \(p\)-quasi-random if, for every fixed graph \(H\) and every fixed proportion \(0<w<1\), the subgraph of \(G(n)\) induced by any vertex subset of size \(wn\) contains as many copies of \(H\) as would be expected in \(G(n,p)\).
0 references
random graph
0 references
pseudo-randomness
0 references
quasi-randomness
0 references
0 references