The ramsey number for theta graph versus a clique of order three and four
For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is the smallest positive integer N with the property that every graph on at least N vertices contains F1 or its complement contains F2 as a subgraph. In this paper, we consider the Ramsey numbers for theta-complete graphs. We determine...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
University of Zielona Góra
2014-05-01
|
| Colecção: | Discussiones Mathematicae Graph Theory |
| Assuntos: | |
| Acesso em linha: | https://doi.org/10.7151/dmgt.1730 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|