2 problems
Let be a graph and let be a subset of the vertices of . An -path is a path in whose two endpoints belong to . For subsets of vertices of and integers…
Fejes Tóth's hexagonal density conjecture. For any and any -arrangement in ,
Let be a graph and let be a subset of the vertices of . An -path is a path in whose two endpoints belong to . For subsets of vertices of and integers…
Fejes Tóth's hexagonal density conjecture. For any and any -arrangement in ,