K_{s,t}-free graphs admit balanced clique subdivisions of order Ω(d^{s/(2(s-1))}) and satisfy a (s/(2(s-1)) - o(1)) log d lower bound on the sum of reciprocal cycle lengths.
Then by Proposition 3.4, there exists a subgraph of F′ 2, denoted by F2, which is a ( η2m20, m4/2)-expansion of v2
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Balanced clique subdivisions and cycles lengths in $K_{s, t}$-free graphs
K_{s,t}-free graphs admit balanced clique subdivisions of order Ω(d^{s/(2(s-1))}) and satisfy a (s/(2(s-1)) - o(1)) log d lower bound on the sum of reciprocal cycle lengths.