2 problems
- 0 votes0 replies1 view
Semi-inducibility conjecture for symmetric paths
Let be a path of length whose first edges are red and whose remaining edges are blue. Let be the graph formed by a clique on …
- 0 votes0 replies0 views
The maximal semi-inducibility conjecture for the 4-vertex graph H_3
Semi-inducibility conjecture for . The semi-induced density satisfies