2 problems

0 votes0 replies0 views
Extremal number of 2-connected graphs avoiding cycles of length 2 modulo 2k
Conjecture on the 2-connected extremal number.
Conjectureopen2-connected-graphs cycle-avoidance extremal-graph-theoryarXiv posted 2 days ago
0 votes0 replies0 views
The fourth and fifth maximum Wiener index conjecture for 2-connected graphs
Let $H_{n,2,2}$ be the graph obtained from the cycle-based construction described in the paper, and let $H_{n,2,2}^+$ be obtained from $H_{n,2,2}$ by adding an edge between two ver…
Conjectureopen2-connected-graphs graph-theory wiener-indexarXiv posted 2 days ago

Extremal number of 2-connected graphs avoiding cycles of length 2 modulo 2k