A graph theoretical approach for combinatorial designs

Mathematics

1. Uniform Hypergraph 100%
2. Vertex of a graph 98%
3. Hypergraph 95%
4. Disjoint 76%
5. Cycle 69%
6. Tiling 69%
7. Edge-colored Graph 63%
8. Complete Graph 60%
9. Minimum Degree 51%
10. Path 50%
11. Steiner Triple System 42%
12. Oriented Graph 40%
13. Infinite Graphs 38%
14. Vertex Degree 36%
15. Color 36%
16. Edge Coloring 36%
17. Tournament 36%
18. Spanning tree 33%
19. Chromatic number 32%
20. Random Graphs 31%
21. Bipartite Graph 30%
22. Branch 28%
23. Subset 27%
24. Subgraph 27%
25. Covering 26%
26. Partition 24%
27. Optical Networks 24%
28. Graph in graph theory 20%
29. Erdös 16%
30. Partitioning 16%
31. Steiner System 14%
32. Form 14%
33. Triple System 13%
34. Connected graph 13%
35. Vertex Coloring 12%
36. Absorbing 12%
37. Optimization Problem 11%
38. Perfect Matching 11%
39. Girth 11%
40. Resolve 10%
41. Design 10%
42. Triangle 9%
43. Evidence 9%
44. Adjacent 9%
45. Union 8%
46. Cover 8%
47. Consecutive 7%
48. Denote 6%
49. If and only if 6%
50. Generalise 6%
51. Language 6%
52. Arbitrary 5%
53. Generalization 5%