2 problems
- 0 votes0 replies0 views
Exactness conjecture for cylindrical graph domination bounds
Let be the path graph on vertices, let be the cycle graph on vertices, and let denote their Cartesian product. Write for its…
- 0 votes0 replies0 views
Linear disjoint-edge conjecture for complete monotone simple cylindrical graphs
Linear disjoint-edge conjecture. Every complete monotone simple cylindrical graph contains at least pairwise disjoint edges, for some fixed constant .