Oliver Josef Nikolaus Cooley

Mathematik

1. Hypergraph 100%
2. Random Graphs 61%
3. Connectedness 46%
4. Uniform Hypergraph 40%
5. Phase Transition 40%
6. Order Component 35%
7. Simplicial Complex 34%
8. Hypertree 34%
9. Giant Component 30%
10. Connected Components 28%
11. Cohomology of Groups 28%
12. Hitting Time 26%
13. Higher Order 22%
14. Graph in graph theory 22%
15. Cycle 22%
16. Sharp Threshold 19%
17. Parity 16%
18. Forcing 15%
19. Critical Threshold 12%
20. Random variable 11%
21. Induced Matching 11%
22. Random Structure 10%
23. Isomorphic 10%
24. Longest Path 10%
25. Model 10%
26. Bisection 9%
27. Closure 9%
28. Pairwise 9%
29. Integer 9%
30. Constant function 9%
31. Homology Groups 8%
32. Cohomology Group 8%
33. Intersect 8%
34. Vertex Degree 8%
35. Symmetry 8%
36. Depth-first Search 8%
37. Long Cycle 8%
38. Slice 8%
39. Consecutive 8%
40. Regularity Lemma 7%
41. Vertex of a graph 7%
42. Mirror 7%
43. Obstruction 6%
44. Subgraph 6%
45. Walk 6%
46. Constraint Satisfaction Problem 6%
47. Column space 6%
48. Overlap 5%
49. Vanish 5%
50. Monotone 5%