2 problems

Győri–Salia–Tompkins–Zamora path extremal graph conjecture
For odd $k\geq5$ , let $H_{n,k}$ be the graph obtained from a clique $K_{\lfloor k/2\rfloor}$ by choosing a vertex $v$ , adding $m$ independent vertices adjacent to $v$ , and adding…
openFrom papersgeneralized-turan-problems paths
0 responses
6
Subquadratic conjecture for odd cycles with an additional forbidden odd cycle
Subquadratic odd-cycle conjecture. There exists an $\epsilon>0$ such that
openFrom papersextremal-graph-theory generalized-turan-problems odd-cycles
0 responses
5

Győri–Salia–Tompkins–Zamora path extremal graph conjecture