4 problems

0 votes0 replies0 views
Cambie–Cames van Batenburg–Joannis de Verclos–Kang asymptotic conjecture for $h_t(\Delta)$
For positive integers $\Delta$ and $t$ , let $h_t(\Delta)$ be the smallest integer such that every graph $G$ with at least $h_t(\Delta)$ edges and maximum degree…
Conjecturesolvedasymptotic-combinatorics degree-diameter graph-distancesarXiv posted 2 days ago
0 votes0 replies0 views
Cambie–Cames van Batenburg–Joannis de Verclos–Kang conjecture for $h_3(\Delta)$
For positive integers $\Delta$ and $t$ , let $h_t(\Delta)$ be the smallest integer such that every graph $G$ with at least $h_t(\Delta)$ edges and maximum degree…
Conjecturesolveddegree-diameter extremal-graph-theory graph-distancesarXiv posted 2 days ago
0 votes0 replies0 views
The asymptotic upper-bound conjecture for edge diameter
Asymptotic upper-bound conjecture. For $t\ne 2$ and any $\varepsilon>0$ ,
Conjectureopenasymptotic-combinatorics degree-diameter graph-theoryarXiv posted 2 days ago
0 votes0 replies0 views
The cubic edge diameter conjecture for maximum degree
Cubic edge diameter conjecture.
Conjectureopendegree-diameter extremal-graph-theory graph-theoryarXiv posted 2 days ago

Cambie–Cames van Batenburg–Joannis de Verclos–Kang asymptotic conjecture for ht(Δ)h_t(\Delta)ht​(Δ)