Back to Search
Start Over
The homomorphism threshold of {C3,C5}‐free graphs.
- Source :
-
Journal of Graph Theory . Jan2019, Vol. 90 Issue 1, p83-106. 24p. - Publication Year :
- 2019
-
Abstract
- We determine the structure of {C3,C5}‐free graphs with n vertices and minimum degree larger than n/5: such graphs are homomorphic to the graph obtained from a (5k−3)‐cycle by adding all chords of length 1(mod5), for some k. This answers a question of Messuti and Schacht. We deduce that the homomorphism threshold of {C3,C5}‐free graphs is 1/5, thus answering a question of Oberkampf and Schacht. [ABSTRACT FROM AUTHOR]
- Subjects :
- *GRAPH theory
*HOMOMORPHISMS
*GRAPHIC methods
*SUBGRAPHS
*BIPARTITE graphs
Subjects
Details
- Language :
- English
- ISSN :
- 03649024
- Volume :
- 90
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Journal of Graph Theory
- Publication Type :
- Academic Journal
- Accession number :
- 133012063
- Full Text :
- https://doi.org/10.1002/jgt.22369