Long induced paths inK s,s-free graphs.Journal of Graph Theory, 2026

Zach Hunter, Aleksa Milojević, Benny Sudakov, István Tomon · 2026 · Journal of Graph Theory · DOI 10.1002/jgt.70040

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

math.CO · 2026-07-15 · accept · novelty 7.0

For {P_s,K_{t,t}}-free graphs, the maximum path length is at most 2^{ω(G)^c}, and treedepth is clique-polynomial.

Showing 1 of 1 citing paper.

Excluding paths and bicliques math.CO · 2026-07-15 · accept · none · ref 22
For {P_s,K_{t,t}}-free graphs, the maximum path length is at most 2^{ω(G)^c}, and treedepth is clique-polynomial.