1 problem

Quadratic additive bound conjecture for sparse spanning strongly connected subgraphs of tournaments
Let $k$ be a positive integer, and let $T$ be a strongly $k$ -connected tournament on $n$ vertices. A strongly $k$ -connected spanning subgraph is a spanning subgraph with strong ver…
opendigraph-connectivity spanning-subgraphs tournaments
0 responses
06

Quadratic additive bound conjecture for sparse spanning strongly connected subgraphs of tournaments