Advanced search
Start date
Betweenand


Complete immersions in graphs with independence number two and small forbidden subgraphs

Full text
Author(s):
Quiroz, Daniel A. ; Ferreira, CE ; Lee, O ; Miyazawa, FK
Total Authors: 4
Document type: Journal article
Source: PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM; v. 195, p. 7-pg., 2021-01-01.
Abstract

The analogue of Hadwiger's conjecture for the immersion order states that every graph G contains the complete graph K-chi(G) as an immersion. Like its minor-order counterpart it is open even for graphs with independence number 2. Let G and H be graphs with independence number at most 2, such that vertical bar V(H)vertical bar <= 4. We show that if G is H-free, then G satisfies the conjecture. (C) 2021 The Authors. Published by Elsevier B.V. (AU)

FAPESP's process: 19/13364-7 - Extremal and structural problems in graph theory
Grantee:Cristina Gomes Fernandes
Support Opportunities: Regular Research Grants