Tree-independence number and excluding ladder and wheel as an induced minor

2025-08-25
15:00-16:00
FAMNIT-MP1
Mujin Choi (KAIST and IBS DIMAG)
Tree-independence number and excluding ladder and wheel as an induced minor
 
In this talk, we show that for all positive integers and d, the class of $K_{1,d}$-free graphs not containing the k-ladder or the k-wheel as an induced minor has a bounded tree-independence number.
Our proof uses a generalization of the concept of brambles to tree-independence number.

Delite z drugimi

Leave a Reply

Vaš e-naslov ne bo objavljen. * označuje zahtevana polja

Orodna vrstica za dostopnost