Works matching IS 09635483 AND DT 2022 AND VI 31 AND IP 2
Results: 8
On the edit distance function of the random graph.
- Published in:
- Combinatorics, Probability & Computing, 2022, v. 31, n. 2, p. 345, doi. 10.1017/S0963548321000353
- By:
- Publication type:
- Article
On Turán exponents of bipartite graphs.
- Published in:
- Combinatorics, Probability & Computing, 2022, v. 31, n. 2, p. 333, doi. 10.1017/S0963548321000341
- By:
- Publication type:
- Article
On the mixing time of coordinate Hit-and-Run.
- Published in:
- Combinatorics, Probability & Computing, 2022, v. 31, n. 2, p. 320, doi. 10.1017/S0963548321000328
- By:
- Publication type:
- Article
Lower bound on the size of a quasirandom forcing set of permutations.
- Published in:
- Combinatorics, Probability & Computing, 2022, v. 31, n. 2, p. 304, doi. 10.1017/S0963548321000298
- By:
- Publication type:
- Article
Perfect matchings, rank of connection tensors and graph homomorphisms.
- Published in:
- Combinatorics, Probability & Computing, 2022, v. 31, n. 2, p. 268, doi. 10.1017/S0963548321000286
- By:
- Publication type:
- Article
Spectral gap in random bipartite biregular graphs and applications.
- Published in:
- Combinatorics, Probability & Computing, 2022, v. 31, n. 2, p. 229, doi. 10.1017/S0963548321000249
- By:
- Publication type:
- Article
Continuous phase transitions on Galton–Watson trees.
- Published in:
- Combinatorics, Probability & Computing, 2022, v. 31, n. 2, p. 198, doi. 10.1017/S0963548321000237
- By:
- Publication type:
- Article
On directed analogues of expander and hyperfinite graph sequences.
- Published in:
- Combinatorics, Probability & Computing, 2022, v. 31, n. 2, p. 184, doi. 10.1017/S0963548321000225
- By:
- Publication type:
- Article