Vadim V. Lozin

collaborators

2 papers

math.CO2025

Awesome graph parameters

Kenny BeÅ¡ter Å torgel, ClÃ©ment Dallard, Vadim Lozin +2

For a graph $G$ , we denote by $I^\pm (G)$ the size of a maximum independent set and by $I ¨ (G)$ the size of a maximum clique in $G$ . Our paper lies on the edge of two lines of research,…

math.CO2025

Graph Classes Closed under Self-intersection

Konrad K. Dabrowski, Vadim V. Lozin, Martin MilaniÄ +3

A graph class is monotone if it is closed under taking subgraphs. It is known that a monotone class defined by finitely many obstructions has bounded treewidth if and only if one o…