1 problem
- 0 votes0 replies0 views
The induced Erdős–Pósa conjecture for S-cycles
Let be a graph and . An -cycle is a cycle containing a vertex of , and an induced packing is a collection of cycles with no edge between distinct cycles.…
The induced Erdős–Pósa conjecture for S-cycles
Let be a graph and . An -cycle is a cycle containing a vertex of , and an induced packing is a collection of cycles with no edge between distinct cycles.…