Artykuł w czasopiśmie
Brak miniatury
Licencja

ClosedAccessDostęp zamknięty
 

Excluding Hooks and their Complements

dc.abstract.enThe long-standing Erdős-Hajnal conjecture states that for every n-vertex undirected graph H there exists ϵ(H)>0 such that every graph G that does not contain H as an induced subgraph contains a clique or an independent set of size at least nϵ(H). A natural weakening of the conjecture states that the polynomial-size clique/independent set phenomenon occurs if one excludes both H and its complement Hc. These conjectures have been shown to hold for only a handful of graphs: it is not even known if they hold for all graphs on 5 vertices. In a recent breakthrough, the symmetrized version of the Erdős-Hajnal conjecture was shown to hold for all paths. The goal of this paper is to show that the symmetrized conjecture holds for all trees on 6 (or fewer) vertices. In fact this is a consequence of showing that the symmetrized conjecture holds for any path with a pendant edge at its third vertex; thus we also give a new infinite family of graphs for which the symmetrized conjecture holds.
dc.affiliationUniwersytet Warszawski
dc.contributor.authorLiebenau, Anita
dc.contributor.authorChoromanski, Krzysztof
dc.contributor.authorFalik, Dvir
dc.contributor.authorPilipczuk, Marcin
dc.contributor.authorPatel, Viresh
dc.date.accessioned2024-01-25T00:06:38Z
dc.date.available2024-01-25T00:06:38Z
dc.date.issued2018
dc.description.financeNie dotyczy
dc.description.number3
dc.description.volume25
dc.identifier.doi10.37236/6397
dc.identifier.issn1097-1440
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/106698
dc.identifier.weblinkhttps://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p27
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.ispartofElectronic Journal of Combinatorics
dc.relation.pagesP3.27:1 - P3.27: 33
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.titleExcluding Hooks and their Complements
dc.typeJournalArticle
dspace.entity.typePublication