Polynomial eta-boundedness of P5P_5P5-free graphs
Polynomial P5P_5P5-free eta-boundedness conjecture. There exists d∈Nd\in\mathbb{N}d∈N such that every P5P_5P5-free graph GGG satisfies η(G)≤ω(G)d\eta(G)\leq\omega(G)^dη(G)≤ω(G)d.