1 problem
For a graph , let be the maximum integer such that contains a totally odd strong immersion of , and let denote its chromatic numbe…
For a graph , let be the maximum integer such that contains a totally odd strong immersion of , and let denote its chromatic numbe…