Found: 8
Select item for more details and to access through your institution.
Szemerédi's partition and quasirandomness.
- Published in:
- Random Structures & Algorithms, 1991, v. 2, n. 1, p. 1, doi. 10.1002/rsa.3240020102
- By:
- Publication type:
- Article
Almost all graphs with 1.44n edges are 3-colorable.
- Published in:
- Random Structures & Algorithms, 1991, v. 2, n. 1, p. 11, doi. 10.1002/rsa.3240020103
- By:
- Publication type:
- Article
Randomized greedy matching.
- Published in:
- Random Structures & Algorithms, 1991, v. 2, n. 1, p. 29, doi. 10.1002/rsa.3240020104
- By:
- Publication type:
- Article
A central limit theorem on gl<sub>n</sub>(f<sub>q</sub>).
- Published in:
- Random Structures & Algorithms, 1991, v. 2, n. 1, p. 47, doi. 10.1002/rsa.3240020105
- By:
- Publication type:
- Article
Excluding induced subgraphs: quadrilaterals.
- Published in:
- Random Structures & Algorithms, 1991, v. 2, n. 1, p. 55, doi. 10.1002/rsa.3240020106
- By:
- Publication type:
- Article
Inequalities in probability theory and turán-type problems for graphs with colored vertices.
- Published in:
- Random Structures & Algorithms, 1991, v. 2, n. 1, p. 73, doi. 10.1002/rsa.3240020107
- By:
- Publication type:
- Article
A power law for connectedness of some random graphs at the critical point.
- Published in:
- Random Structures & Algorithms, 1991, v. 2, n. 1, p. 101, doi. 10.1002/rsa.3240020108
- By:
- Publication type:
- Article
Masthead.
- Published in:
- Random Structures & Algorithms, 1991, v. 2, n. 1, p. fmi, doi. 10.1002/rsa.3240020101
- Publication type:
- Article