3 problems
- 0 votes0 replies1 view
The principal conjecture on clique coverings and stable sets in B-graphs
Let be a B-graph, meaning that , and suppose that has no isolated vertices. Let be the greatest natural number such that every edge of …
- 0 votes0 replies0 views
Linear clique-cover growth for bounded-degree multipartite hypergraphs
Linear-growth conjecture. For every ,
- 0 votes0 replies1 view
Javadi–Maleki–Omoomi conjecture on local clique cover numbers
Let be a graph on vertices, and let denote its local clique cover number. Let be the complement of . Javadi–Maleki–Omoomi conjectu…